Article (Scientific journals)
The maximum deviation just-in-time scheduling problem
Brauner, Nadia; Crama, Yves
2004In Discrete Applied Mathematics, 134 (1-3), p. 25-50
Peer Reviewed verified by ORBi
 

Files


Full Text
JITFinalVersion.PDF
Author postprint (457.66 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
scheduling; sequencing; just-in-time; high multiplicity; convex graphs; balanced words
Abstract :
[en] 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. (C) 2003 Elsevier B.V. All rights reserved.
Disciplines :
Quantitative methods in economics & management
Author, co-author :
Brauner, Nadia
Crama, Yves  ;  Université de Liège - ULiège > HEC - École de gestion de l'ULiège > Recherche opérationnelle et gestion de la production
Language :
English
Title :
The maximum deviation just-in-time scheduling problem
Publication date :
05 January 2004
Journal title :
Discrete Applied Mathematics
ISSN :
0166-218X
eISSN :
1872-6771
Publisher :
Elsevier Science Bv, Amsterdam, Netherlands
Volume :
134
Issue :
1-3
Pages :
25-50
Peer reviewed :
Peer Reviewed verified by ORBi
Commentary :
Available online at www.sciencedirect.com
Available on ORBi :
since 02 December 2008

Statistics


Number of views
227 (9 by ULiège)
Number of downloads
279 (2 by ULiège)

Scopus citations®
 
25
Scopus citations®
without self-citations
20
OpenCitations
 
22

Bibliography


Similar publications



Contact ORBi