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

Artikel

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.

Angaben zum Objekt

• Sprache: Englisch

Verweise und Beziehungen

• Erschienen in: Journal: Journal of Industrial Engineering International ; ISSN: 2251-712X ; Volume: 8 ; Year: 2012 ; Pages: 1-7 ; Heidelberg: Springer

Klassifikation und Themen

• Klassifikation: Management
• Thema: assembly flowshop scheduling ; sequence-dependent setup times ; blocking times ; weighted mean completion time ; makespan ; Simulated annealing

Beteiligte, Orts- und Zeitangaben

• Ereignis: Geistige Schöpfung
• (wer): Maleki-Darounkolaei, Aref ; Modiri, Mahmoud ; Tavakkoli-Moghaddam, Reza ; Seyyedi, Iman
• Ereignis: Veröffentlichung
• (wer): Springer
• (wo): Heidelberg
• (wann): 2012

Weitere Informationen

• DOI: doi:10.1186/2251-712X-8-26
• Handle: http://hdl.handle.net/10419/78575
• Letzte Aktualisierung: 10.03.2025, 11:42 MEZ