Cost constrained fixed job scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2841, Issue , 2003, Pages 111-124

  Huang, Qiwei ^a   Lloyd, Errol ^b  

^a UTStarcom Inc   (China)

^b University of Delaware   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GATEWAYS (COMPUTER NETWORKS); SCHEDULING;

APPROXIMATION RATIOS; CONSTANT RATIO; MULTIMEDIA GATEWAY; NETWORK-FLOW-BASED ALGORITHM; PROCESSING COSTS; PROCESSING TIME; TIME PROCESSING; WORST-CASE PERFORMANCE RATIO;

JOB SHOP SCHEDULING;

EID: 0142156591     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45208-9_10     Document Type: Article

References (10)

1. Matteo Fischetti, Silvano Martello, Paolo Toth, The Fixed Job Schedule Problem with Spread-Time Constraints, Operations Research. 35(6), 849-858, 1987.
2. Matteo Fischetti, Silvano Martello, Paolo Toth, The Fixed Job Schedule Problem with Working-Time Constraints, Operations Research. 37(3), 395-403, 1989.
3. Antoon W.J. Kolen, Leo G. Kroon, On the Computational Complexity of (Maximum) Class Scheduling, European Journal of Operational Research, 54, 23-38, 1991.
4. Antoon W.J. Kolen, Leo G. Kroon, License Class Design: Complexity and Algorithms, European Journal of Operational Research, 63, 432-444, 1992
5. Antoon W.J. Kolen, Leo G. Kroon, On the Computational Complexity of (Maximum) Shift Class Scheduling, European Journal of Operational Research, 64, 138-151, 1993.
6. Antoon W.J. Kolen, Leo G. Kroon, An Analysis of Shift Class Design Problems, European Journal of Operational Research, 79, 417-430, 1994.
7. Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy, The optimal cost chromatic partition problem for trees and interval graphs, Graph Theoretical Concepts in Computer Science, LNCS, vol. 1197, Springer-Verlag, New York/Berlin, 1996.
8. Klaus Jansen, Approximation Results for the Optimal Cost Chromatic Partition Problem, Journal of Algorithms, 34, 54-89, 2000.
9. Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin, Network Flows. Prentice Hall, 1993
10. Michael R. Garey, David S. Johnson, Computer and Intractability, A Guide to the Theory of NP-Completeness. Twenty-second printing, 2000.