A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times

Journal of Industrial Engineering International

دوره 8، شماره 1، فروردین 2012   

نویسندگان

Aref Maleki-Darounkolaei¹؛ Mahmoud Modiri^{* 1}؛ Reza Tavakkoli-Moghaddam²؛ Iman Seyyedi³

¹Department of Management and Accounting, South Tehran Branch, Islamic Azad University, Tehran, Iran

²Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran

³Department of Industrial Engineering, Payame Noor University, Tehran, Iran

چکیده

This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div>
times at the first stage and blocking times between each stage in such a way that the weighted mean
completion time and makespan are minimized. Obtaining an optimal solution for this type of complex,
large-sized problem in reasonable computational time using traditional approaches or optimization tools is
extremely difficult. Thus, this paper proposes a meta-heuristic method based on simulated annealing (SA) in
order to solve the given problem. Finally, the computational results are shown and compared in order to show
the efficiency of our proposed SA.

کلیدواژه‌ها

Assembly flowshop scheduling؛ Sequence-dependent setup times؛ Blocking times؛ Weighted mean completion time؛ Makespan؛ Simulated annealing