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

Authors

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

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

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

Abstract

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.

Keywords

Journal of Industrial Engineering, International

Volume 8, Issue 1
Winter 2012

Files

Share

How to cite

Statistics