Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study

► We study the multi-objective PFSP with setup times problem. ► Review state of the art on the problem and propose a new benchmark and new algorithm. ► Obtained state of the art results for the proposed benchmark. The permutation flowshop scheduling problem has been thoroughly studied in recent deca...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 227; H. 2; S. 301 - 313
Hauptverfasser:	Ciavotta, Michele, Minella, Gerardo, Ruiz, Rubén
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.06.2013 Elsevier Elsevier Sequoia S.A
Schlagworte:	Iterated greedy Iterative methods Job shops Mathematical problems Multi-objective Operations research Pareto optimum Permutation flowshop Production scheduling Scheduling Scheduling algorithms Sequence dependent setup times Studies Sequence dependent setup times Scheduling Permutation flowshop Multi-objective Iterated greedy
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!