Title of article
The maximum deviation just-in-time scheduling problem Original Research Article
Author/Authors
N. Brauner، نويسنده , , Y. Crama، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
26
From page
25
To page
50
Abstract
This note revisits the maximum deviation just-in-time (MDJIT) scheduling problem previously investigated by Steiner and Yeomans. Its main result is a set of algebraic necessary and sufficient conditions for the existence of a MDJIT schedule with a given objective function value. These conditions are used to provide a finer analysis of the complexity of the MDJIT problem. The note also investigates various special cases of the MDJIT problem and suggests several questions for further investigation.
Keywords
Convex graphs , Balanced words , Scheduling , High multiplicity , Sequencing , Just-in-time
Journal title
Discrete Applied Mathematics
Serial Year
2004
Journal title
Discrete Applied Mathematics
Record number
885740
Link To Document