Scheduling linear deteriorating jobs with an availability constraint on a single machine

Theoretical Computer Science

Volumn 362, Issue 1-3, 2006, Pages 115-126

  Ji, Min ^a,b   He, Yong ^b   Cheng, T C E ^c  

^a ZHEJIANG GONGSHANG UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Approximation algorithms; Availability constraint; Computational complexity; Deteriorating job; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FUNCTION EVALUATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SCHEDULING;

APPROXIMATION ALGORITHMS; AVAILABILITY CONSTRAINT; COMPLETION TIME PROBLEM; DETERIORATING JOB;

LINEAR PROGRAMMING;

EID: 33748547219     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.06.006     Document Type: Article

References (18)

1. Alidaee B., and Womer N.K. Scheduling with time dependent processing times: review and extensions. J. Oper. Res. Soc. 50 (1999) 711-720
2. Babat L.G. Linear functions on the n-dimensional unit cube. Dokl. Akad. Nauk SSSR 221 (1975) 761-762 (in Russian)
3. Brown S., and Yechiali U. Scheduling deteriorating jobs on a single process. Oper. Res. 38 (1990) 495-498
4. Chen Z.L. Parallel machine scheduling with time dependent processing times. Discrete Appl. Math. 70 (1996) 81-93
5. Cheng T.C.E., Ding Q., and Lin B.M.T. A concise survey of scheduling with time-dependent processing times. European J. Oper. Res. 152 (2004) 1-13
6. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
7. Gens G.V., and Levner E.V. Approximate algorithms for certain universal problems in scheduling theory. Eng. Cybernet. 6 (1978) 38-43 (in Russian)
8. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5 (1979) 287-326
9. Graves G.H., and Lee C.Y. Scheduling maintenance and semi-resumable jobs on a single machine. Naval Res. Logist. 46 (1999) 845-863
10. Gupta J.N.D., and Gupta S.K. Single facility scheduling with nonlinear processing times. Comput. Industr. Eng. 14 (1988) 387-393
11. Johnson D.S. The NP-complete columns: an ongoing guide. J. Algorithms 2 (1981) 402
12. 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 J. Oper. Res. 47 (1990) 56-64
13. Lee C.Y. Machine scheduling with an availability constraint. J. Global Optim. 8 (1996) 395-417
14. Lee C.Y., Lei L., and Pinedo M. Current trend in deterministic scheduling. Ann. Oper. Res. 70 (1997) 1-42
15. Mosheiov G. Scheduling jobs under simple linear deterioration. Comput. Oper. Res. 21 (1994) 653-659
16. Mosheiov G. Scheduling jobs with step-deterioration: minimizing makespan on single and multi-machine. Comput. Industr. Eng. 28 (1995) 869-879
17. Pinedo M. Scheduling: theory, algorithms, and systems (2002), Prentice-Hall, Upper Saddle River, NJ
18. Wu C.C., and Lee W.C. Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine. Inform. Process. Lett. 87 (2003) 89-93