Total completion time with makespan constraint in no-wait flowshops with setup times

•The multi objective problem with setup times is addressed.•Different algorithms including the most recent ones are proposed.•One of the algorithms performs better than the others, statistically verified.•Algorithms, including the best one in the literature, have the same CPU time.•Best algorithm re...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 238; číslo 3; s. 724 - 734
Hlavní autori:	Allahverdi, Ali, Aydilek, Harun
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.11.2014 Elsevier Sequoia S.A
Predmet:	Algorithms Completion time Computation Computer simulation Flowcharts Genetic algorithms Insertion Job shops Makespan No-wait flowshop Operational research Production scheduling Scheduling Setup times Simulated annealing Studies Total completion time Scheduling Makespan No-wait flowshop Total completion time Setup times
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!