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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 227; číslo 2; s. 301 - 313
Hlavní autori:	Ciavotta, Michele, Minella, Gerardo, Ruiz, Rubén
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.06.2013 Elsevier Elsevier Sequoia S.A
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!