Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times

We propose four algorithms for the no-wait flow shop scheduling problem. The objective is minimizing total completion time such that makespan is not greater than a maximum value. We address the problem with sequence-dependent setup times, an important production constraint that has never been consid...

Full description

Saved in:

Bibliographic Details
Published in:	The Journal of the Operational Research Society Vol. 74; no. 1; pp. 362 - 373
Main Authors:	Almeida, Fernando Siqueira de, Nagano, Marcelo Seido
Format:	Journal Article
Language:	English
Published:	Taylor & Francis 02.01.2023
Subjects:	Flow shop greedy makespan no-wait sequence-dependent setup total completion time
ISSN:	0160-5682, 1476-9360
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!