A batch scheduling scheme for the workcenter that supplies parts to a mixed-model assembly line

1997 ◽  
Vol 33 (3-4) ◽  
pp. 757-760 ◽  
Author(s):  
Jun-Geol Baek ◽  
Jong-Kwan Baek ◽  
Sung-Shick Kim
2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Chunzhi Cai ◽  
Shulin Kan

In the contemporary industrial production, multiple resource constraints and uncertainty factors exist widely in the actual job shop. It is particularly important to make a reasonable scheduling scheme in workshop manufacturing. Traditional scheduling research focused on the one-time global optimization of production scheduling before the actual production. The dynamic scheduling problem of the workshop is getting more and more attention. This paper proposed a simulated annealing algorithm to solve the real-time scheduling problem of large variety and low-volume mixed model assembly line. This algorithm obtains three groups of optimal solutions and the optimal scheduling scheme of multiple products, with the shortest product completion time and the lowest cost. Finally, the feasibility and efficiency of the model are proved by the Matlab simulation.


2007 ◽  
Vol 45 (22) ◽  
pp. 5265-5284 ◽  
Author(s):  
Erdal Erel ◽  
Yasin Gocgun ◽  
İhsan Sabuncuoğlu

Sign in / Sign up

Export Citation Format

Share Document