首页|Reversal sequence integrated scheduling algorithm of multiple workshop with multi-procedures ended together
Reversal sequence integrated scheduling algorithm of multiple workshop with multi-procedures ended together
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
<publishercopyright>? 2018, Editorial Board of Jilin University. All right reserved.</publishercopyright>? 2018, Editorial Board of Jilin University. All right reserved. <com:para >To solve the problem in multiple workshop manufacturing that there are single complex products with multi-procedures ended at the same time, a reversal sequence integrated scheduling algorithm is proposed. First, a reverse batch scheduling strategy is designed to solve the problem that migrate virtual processes for positive sequence scheduling can lead to equipment resource idle operating complex. Then, in order to reduce the process migration and keep the balance of load among the workshops, the workshop identified strategy is proposed to assign all the processes to the workshops. Finally, in order to satisfy the special constraints of multi-procedures ended at the same time, a strategy of reversal sequence starting together is designed to determine the reverse starting processing time of each virtual procedure group. A case study verifies that the proposed algorithm meets the special constraints, and the completion time is shortened with less process migrations.</com:para>To solve the problem in multiple workshop manufacturing that there are single complex products with multi-procedures ended at the same time, a reversal sequence integrated scheduling algorithm is proposed. First, a reverse batch scheduling strategy is designed to solve the problem that migrate virtual processes for positive sequence scheduling can lead to equipment resource idle operating complex. Then, in order to reduce the process migration and keep the balance of load among the workshops, the workshop identified strategy is proposed to assign all the processes to the workshops. Finally, in order to satisfy the special constraints of multi-procedures ended at the same time, a strategy of reversal sequence starting together is designed to determine the reverse starting processing time of each virtual procedure group. A case study verifies that the proposed algorithm meets the special constraints, and the completion time is shortened with less process migrations.
NSTL
