An Efficient Implementation of a Two-Stage Production Scheduling Algorithm

1989 ◽  
Vol 40 (11) ◽  
pp. 1049
Author(s):  
Wing S. Chow
2012 ◽  
Vol 271-272 ◽  
pp. 650-656
Author(s):  
Zhi Bing Lu ◽  
Ai Min Wang ◽  
Cheng Tong Tang ◽  
Jing Sheng Li

For the rapid response to production scheduling problem driven by high-density production tasks, a dynamic scheduling technology for the large precision strip products assembly with a mixture of task time nodes and line-rail space is proposed. A scheduling constrained model containing coverage, proximity, timeliness and resource is established. A linear rail space production scheduling technology using heuristic automatic scheduling and event-driven method is put forward. The time rule based on delivery and single completion assembly is formed, at the same time the space rule based on the adjacent rail and comprehensive utilization is researched. Supposing the privilege of single product assembling as the core, the scheduling parts filter method based on multiple constraints and former rules. For the space layout problem, a clingy forward and backward algorithms is proposed to judge the assemble position regarding the space comprehensive utilization rate. The classification of the various disturbances in the actual production is summarized. Three basic algorithms are proposed, including insertion, moving and re-scheduling algorithm, in order to solve the assembly dynamic scheduling problem driven by production disturbance events. Finally, take rocket as the example, the rocket assembly space production scheduling system is developed, combining with the proposed algorithm. The practicability of the system is validated using real data.


Author(s):  
Indukuri R. Krishnam Raju ◽  
Penmasta Suresh Varma ◽  
M. V. Rama Sundari ◽  
G. Jose Moses

Sign in / Sign up

Export Citation Format

Share Document