Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration

Computers and Mathematics with Applications

Volumn 56, Issue 1, 2008, Pages 257-265

  Low, Chinyao ^a   Hsu, Chou Jung ^a,b   Su, Chwen Tzeng ^a  

^a NATIONAL YUNLIN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b NAN KAI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

0 1 integer programming; Bin packing; Makespan; Simple linear deterioration

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

BIN PACKING; MACHINE SCHEDULING; SIMPLE LINEAR DETERIORATION;

CONSTRAINT THEORY;

EID: 43049183622     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2007.12.006     Document Type: Article

References (10)

1. Browne S., and Yechiali U. Scheduling deteriorating jobs on a single processor. Operations Research 38 (1990) 495-498
2. Kunnathur A.S., and Gupta S.K. Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operations Research 47 (1990) 56-64
3. Mosheiov G. Scheduling jobs with step-deterioration: Minimizing makespan on single and multi-machine. Computers and Industrial Engineering 28 (1995) 869-879
4. Mosheiov G. Scheduling deteriorating jobs under simple linear deterioration. Computers and Operations Research 21 (1994) 653-659
5. Cheng T.C.E., Ding Q., and Lin B.M.T. A concise survey of scheduling with time-dependent processing times. European Journal of Operations Research 152 (2004) 1-13
6. Wu C.C., and Lee W.C. Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine. Information Processing Letters 87 (2003) 89-93
7. Ji M., He Y., and Cheng T.C.E. Scheduling linear deteriorating jobs with an availability constraint on a single machine. Theoretical Computer Science 362 (2006) 115-126
8. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
9. Johnson D.S. The NP-complete columns: An ongoing guide. Journal of Algorithms 4 (1981) 393-405
10. Mosheiov G. Multi-machine scheduling with linear deterioration. INFOR 36 4 (1998) 205-214