An Algorithm of Simple Multi-Product Scheduling Problem with No-wait Constraint between Operations

摘要：

Considering the simple multi-product scheduling problem that there is no-wait constraint between operations, an algorithm is presented which combines the ACPM (allied critical path method) and BFSM (best fit scheduling method) scheduling algorithm. In this algorithm the operations with nowait constraint and finish-to-start constraint can be converted into a virtual operation. So the scheduling problem with no-wait constraint can be converted into the scheduling problem without no-wait constraint operations but with virtual operations. Then the movement and adjustment algorithm is adopted to sequence the operations which are converted into virtual operation on corresponding machines. So the problem with no-wait constraint between operations can be resolved. Example shows that the method with virtual operations and the movement and adjustment algorithm presented by this paper can be easy to realize, and favorable results can be obtained.

关键词： simple multi-product scheduling algorithm no-wait constraint virtual operation movement and adjustment algorithm

作者: Xie Zhiqiang Yang Jing He Yujing Li Zhimin

作者单位: Harbin Engineering University,Harbin 150001,China Harbin University of Science and Technology,Harbin Harbin Engineering University,Harbin 150001,China Harbin University of Science and Technology,Harbin 150080,China

会议类型: 国际会议

会议名称: 2010 International Conference on Material and Manufacturing Technology(2010材料与制造技术国际会议 ICMMT2010)

会议地点: 重庆

会议语种:英文

页码: 902-907

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