考虑迁移工序结束时间的非对称二车间综合调度算法

Integrated Scheduling Algorithm of Two Asymmetry Workshops Taking the Finishing Time of Migration Process into Account

针对以往相同两车间综合调度算法没有考虑工序迁移时间以及不能推广解决更普遍的非对称两车间的综合调度问题,提出考虑迁移工序结束时间的非对称二车间综合调度算法.该算法按动态关键路径法对工序进行排序,按序为工序选择车间;在选择车间时,设计基于迁移工序结束时间最小策略,将特殊工序选择到指定车间,将普通工序计算迁移时间后再选择能够最早完工的车间.实例表明,该算法不仅复杂度在二次项以内而且较优地实现具有不同设备资源的二车间分布式综合调度,并且无需分析迁移次数,有效的减少了产品完工时间.

Aiming at that the problem that the past two same workshops integrated scheduling algorithm didn＇t take the finishing time of migration process into account and cannot solve general asymmetric two workshops scheduling, proposed integrated scheduling algo- rithm of two asymmetry workshops taking the finishing time of migration process into account. The algorithm sorting process according to the method of the dynamic critical path, Choosing the workshop in sequential for process, Designed the strategy of the end of the minimum time of migration process when the time choosing the workshop, assigned the special process to a fixed workshop and calcu- lating the migration time of the ordinary process then choose the workshop which can earlier completion. The instance shows that, the algorithm not only the complexity within two times but also can achieve distributed integrated scheduling in two workshops with differ- ent equipment resources better,don＇t need to analyze the numbers of migration, at the same time,reduce the product finishing time ef- fectively.