Parallel-machine scheduling with simple linear deterioration to minimize total completion time

European Journal of Operational Research

Volumn 188, Issue 2, 2008, Pages 342-347

  Ji, Min ^a   Cheng, T C E ^b  

^a ZHEJIANG GONGSHANG UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Deteriorating jobs; FPTAS; Parallel machine scheduling

Indexed keywords

APPROXIMATION THEORY; DATA PROCESSING; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

IDENTICAL MACHINES; LINEAR DETERIORATION; PARALLEL-MACHINE SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 38149101038     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.04.050     Document Type: Article

References (15)

1. Alidaee B., and Womer N.K. Scheduling with time dependent processing times: Review and extensions. Journal of Operational Research Society 50 (1999) 711-720
2. Brown S., and Yechiali U. Scheduling deteriorating jobs on a single process. Operations Research 38 (1990) 495-498
3. Chen Z.L. Parallel machine scheduling with time dependent processing times. Discrete Applied Mathematics 70 (1996) 81-93
4. Z.L. Chen, Erratum to "Parallel machine scheduling with time dependent processing times" [Discrete Applied Mathematics 70 (1996) 81-93], Discrete Applied Mathematics, 1997 (75) 103.
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 Operational Research 152 (2004) 1-13
6. Gupta J.N.D., and Gupta S.K. Single facility scheduling with nonlinear processing times. Computers and Industrial Engineering 14 (1988) 387-393
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. Kovalyov M.Y., and Kubiak W. A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. Journal of Heuristics 3 (1998) 287-297
9. Kovalyov M.Y., and Kubiak W. A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Operations Research 47 (1999) 757-761
10. Kubiak W., and van de Velde S.L. Scheduling deteriorating jobs to minimize makespan. Naval Research Logistics 45 (1998) 511-523
11. 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 Operational Research 47 (1990) 56-64
12. Mosheiov G. Scheduling jobs under simple linear deterioration. Computers and Operations Research 21 (1994) 653-659
13. Mosheiov G. Multi-machine scheduling with linear deterioration. INFOR 36 4 (1998) 205-214
14. Pinedo M. Scheduling: Theory, Algorithms, and Systems (2002), Prentice-Hall, Upper Saddle River, NJ
15. 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