Scheduling on a proportionate flowshop to minimise total late work

We study a scheduling problem to minimise total late work, i.e. each job is penalised according to the duration of its parts scheduled after its due-date. The machine setting is an m-machine proportionate flow shop. Two versions of the problem are studied: (i) the case that total late work refers to...

Full description

Bibliographic Details

Published in:	International journal of production research Vol. 57; no. 2; pp. 531 - 543
Main Authors:	Gerstl, Enrique, Mor, Baruch, Mosheiov, Gur
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 17.01.2019 Taylor & Francis LLC
Subjects:	Algorithms combinatorial optimization Dynamic programming flow shop Job shops Polynomials Production scheduling Scheduling sequencing total late work
ISSN:	0020-7543, 1366-588X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!