No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan

The no-wait flowshop scheduling problem on m machines with separate setup times is addressed to minimize total tardiness with an upper bound on makespan. Conditions for a dominance rule are established. Then, a new simulated annealing algorithm utilizing block insertion and block exchange operators...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Applied mathematics and computation Ročník 365; s. 124688
Hlavní autori:	Allahverdi, Ali, Aydilek, Harun, Aydilek, Asiye
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 15.01.2020
Predmet:	Makespan No-wait flowshop Scheduling Setup times Total tardiness Makespan Scheduling No-wait flowshop Total tardiness Setup times
ISSN:	0096-3003, 1873-5649
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!