Study on integrated algorithm of complex multi-product flexible scheduling

摘要：

In order to optimize the processing of complex multiproduct flexible scheduling,a simplified method which converts complex multi-product into a virtual singleproduct is adopted.The complex multi-product flexible scheduling problem is transformed into the virtual single-product flexible scheduling problem.Aiming at the virtual single-product flexible scheduling problem,an integrated algorithm is proposed.This algorithm firstly adopts the allied critical method to confirm the scheduling sequence of operations.Then each operation is simulation processed by the sequencing algorithm on a set of capable machines.Calculate the virtual completion time of this operation and choose the machine which has the minimum virtual completion time.The routing subproblem and sequencing sub-problem are solved at the same time by the proposed algorithm.Experiment shows that the proposed algorithm can solve complex multiproduct flexible scheduling problem with constraint between jobs,it also can solve simple multi-product flexible job-shop scheduling problem with nonrestraint between jobs and obtain satisfying result.

关键词： flexible scheduling complex product flexible scheduling integrated algorithm simulation process

作者: Zhiqiang Xie Shuzhen Hao Lei Zhang 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)

会议地点: 沈阳

会议语种:英文

页码: 553-557

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