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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied mathematics and computation Jg. 365; S. 124688
Hauptverfasser:	Allahverdi, Ali, Aydilek, Harun, Aydilek, Asiye
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 15.01.2020
Schlagworte:	Makespan No-wait flowshop Scheduling Setup times Total tardiness Makespan Scheduling No-wait flowshop Total tardiness Setup times
ISSN:	0096-3003, 1873-5649
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!