Please use this identifier to cite or link to this item:
Maleki-Darounkolaei, Aref
Modiri, Mahmoud
Tavakkoli-Moghaddam, Reza
Seyyedi, Iman
Year of Publication: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Publisher:] SpringerOpen [Place:] Heidelberg [Volume:] 8 [Year:] 2012 [Pages:] 1-7
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup 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
Simulated annealing
Persistent Identifier of the first edition: 
Creative Commons License:
Document Type: 

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.