Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/78575 
Erscheinungsjahr: 
2012
Quellenangabe: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 8 [Publisher:] Springer [Place:] Heidelberg [Year:] 2012 [Pages:] 1-7
Verlag: 
Springer, Heidelberg
Zusammenfassung: 
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.
Schlagwörter: 
assembly flowshop scheduling
sequence-dependent setup times
blocking times
weighted mean completion time
makespan
Simulated annealing
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article

Datei(en):
Datei
Größe
309.4 kB





Publikationen in EconStor sind urheberrechtlich geschützt.