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

Full description

Saved in:

Bibliographic Details
Published in:	Applied mathematics and computation Vol. 365; p. 124688
Main Authors:	Allahverdi, Ali, Aydilek, Harun, Aydilek, Asiye
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 15.01.2020
Subjects:	Makespan No-wait flowshop Scheduling Setup times Total tardiness Makespan Scheduling No-wait flowshop Total tardiness Setup times
ISSN:	0096-3003, 1873-5649
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!