首页 | 本学科首页   官方微博 | 高级检索  
     


A faster polynomial algorithm for 2-cyclic robotic scheduling
Authors:Chengbin Chu
Affiliation:(1) FRE CNRS 2848, Laboratoire d’optimisation des systèmes industriels (LOSI), Institut Charles Delaunay, Université de Technologie de Troyes, 12 rue Marie Curie-BP 2060, 10010 Troyes Cedex, France;(2) School of Management, Hefei University of Technology, China
Abstract:This paper addresses the 2-cyclic identical part scheduling in a no-wait robotic flowshop where exactly two parts enter and two parts leave the production line during each cycle. This problem was previously proved to be polynomially solvable in O(N8log N) time, where N is the number of tanks in the production line. This paper proposes an improved algorithm with reduced complexity O(N5log N).
Keywords:Cyclic scheduling  Hoist scheduling  No-wait flowshop  Polynomial algorithm  Complexity
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号