Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan

European Journal of Operational Research

Volumn 202, Issue 1, 2010, Pages 90-98

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

^a ZHEJIANG GONGSHANG UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Batch scheduling; Computational complexity; FPTAS; Makespan

Indexed keywords

BATCH SCHEDULING; COMPLETION TIME; DETERIORATING JOBS; DYNAMIC PROGRAMMING ALGORITHM; FPTAS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; LINEAR FUNCTIONS; LINEAR PRECEDENCE; LINEAR-TIME ALGORITHMS; MAKESPAN; POLYNOMIAL-TIME; PROCESSING TIME; SCHEDULING PROBLEM; SINGLE MACHINES; STRONGLY NP-HARD; WAITING-TIME;

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION; SYSTEMS ENGINEERING; WIRELESS TELECOMMUNICATION SYSTEMS;

COMPUTATIONAL COMPLEXITY;

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

References (24)

1. Albers S., and Brucker P. The complexity of one-machine batching problems. Discrete Applied Mathematics 47 (1993) 87-107
2. Allahverdi A., Ng C.T., Cheng T.C.E., and Kovalyov M.Y. A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187 (2008) 985-1032
3. Barketau M.S., Cheng T.C.E., Ng C.T., Kotov V., and Kovalyov M.Y. Batch scheduling of step deteriorating jobs. Journal of Scheduling 11 (2008) 17-28
4. Chen Z.L. Parallel machine scheduling with time-dependent processing times. Discrete Applied Mathematics 70 (1996) 81-93
5. Chen Z.L. Erratum to "Parallel machine scheduling with time dependent processing times" [Discrete Appl. Math. 70 (1996) 81-93]. Discrete Applied Mathematics 75 (1997) 103
6. 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
7. Coffman E.G., Yannakakis M., Magazine M.J., and Santos C. Batch sizing and sequencing on a single machine. Annals of Operations Research 26 (1990) 135-147
8. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, San Francisco, CA
9. 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. Annals of Operations Research 5 (1979) 287-326
10. Ji M., and Cheng T.C.E. Parallel-machine scheduling with simple linear deterioration to minimize total completion time. European Journal of Operational Research 188 (2008) 342-347
11. 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
12. Ji M., He Y., and Cheng T.C.E. Batch delivery scheduling with batch delivery cost on a single machine. European Journal of Operational Research 176 (2007) 745-755
13. Johnson D.S. The NP-complete columns: An ongoing guide. Journal of Algorithms 2 (1981) 393-405
14. Kononov A. Combinatorial complexity of scheduling jobs with simple linear processing times. Diskretny Analiz i Issledovanie Operatsii 3 (1996) 15-32 (in Russian)
15. Kovalyov M.Y., and Kubiak W. A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. Journal of Heuristics 3 (1998) 287-297
16. Kovalyov M.Y., and Kubiak W. A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Operations Research 47 (1999) 757-761
17. Lawler E.L., and Moore J.M. A functional equation and its application to resource allocation and sequencing problems. Management Science 16 (1969) 77-84
18. Leung J.Y.-T., Ng C.T., and Cheng T.C.E. Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. European Journal of Operational Research 187 (2008) 1090-1099
19. Low C.Y., Hsu C.-J., and Su C.-T. Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration. Computers and Mathematics with Applications 56 (2008) 257-265
20. Mosheiov G. Scheduling jobs under simple linear deterioration. Computers and Operations Research 21 (1994) 653-659
21. Mosheiov G. Multi-machine scheduling with linear deterioration. INFOR 36 (1998) 205-214
22. Potts C.N., and Kovalyov M.Y. Scheduling with batching: A review. European Journal of Operational Research 120 (2000) 228-249
23. Rothkopf M.H. Scheduling independent tasks on parallel processors. Management Science 12 (1966) 437-447
24. 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