Complexity of a scheduling problem with controllable processing times

Operations Research Letters

Volumn 38, Issue 2, 2010, Pages 123-126

  Choi, Byung Cheon ^a   Leung, Joseph Y T ^b   Pinedo, Michael L ^c  

^a Chungnam National University   (South Korea)

^b University Heights   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Controllable processing time; NP hard; Single machine; Total weighted completion time

Indexed keywords

CONTROLLABLE PROCESSING TIME; NP-HARD; OPEN PROBLEMS; SCHEDULING PROBLEM; SINGLE MACHINES; TOTAL WEIGHTED COMPLETION TIME;

SCHEDULING;

COMPUTATIONAL COMPLEXITY;

EID: 75949090344     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2009.10.011     Document Type: Article

References (6)

1. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, New York
2. Hoogeveen H., and Woeginger G.J. Some comments on sequencing with controllable processing times. Computing 68 (2002) 181-192
3. A. Janiak, Scheduling in computer and manufacturing systems, Wroclaw University of Technology, Wroclaw, Poland, 2006
4. Janiak A., Janiak W., and Lichtenstein M. Resource management in machine scheduling problems: A survey. Decision Making in Manufacturing and Services 1 (2007) 59-89
5. Shabtay D., and Steiner G. A survey of scheduling with controllable processing times. Discrete Applied Mathematics 155 (2007) 1643-1666
6. Wan G., Yen B., and Li C.-L. Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. Information Processing Letters 79 (2001) 273-280