Complex multi-products dynamic scheduling algorithm with sequence-dependent setup times

摘要：

The problem of considering the setup times in scheduling with non-sequence constraint between operations has been researched,but there are no researches on the problem of considering the setup times in processing and assembly integrated scheduling of complex multi-product dynamic scheduling with sequence constraint between operations.So,a complex multi-product dynamic scheduling algorithm is proposed,considering sequence-dependent setup times.The algorithm constructs the virtual manufacturing tree in the way of root alignment and converts the complex multiproduct dynamic scheduling problem to the complex single product scheduling problem.After the scheduling sequence of operations is determined,the starting time of each operation is determined by dynamically inserting setup time once.As the 1proposed algorithm avoids several movements of the scheduled operation when the setup time is inserted,the time complexity is sharply reduced.Theoretical analysis and examples show that the proposed algorithm not only can solve the complex multi-product dynamic scheduling problem with sequence-dependent setup times,but also is simple and practical.

关键词： complex multi-products setup times integrated scheduling algorithm manufacturing tree

作者: Zhiqiang Xie Lan Lan Lei Zhao Jing Yang

作者单位: College of Computer Science and Technology,Harbin University of Science and Technology,Harbin,China College of Computer Science and Technology,Harbin University of Science and Technology,Harbin,China College of Computer Science and Technology,Harbin Engineering University,Harbin,China

会议类型: 国际会议

会议名称: The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

会议地点: 沈阳

会议语种:英文

页码: 19-24

在线出版日期: 2010-03-27（万方平台首次上网日期，不代表论文的发表时间）