Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Computers and Operations Research

Volumn 35, Issue 8, 2008, Pages 2684-2693

  Wang, Ji Bo ^a,b   Ng, C T ^b   Cheng, T C E ^b  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Deteriorating jobs; Makespan; Scheduling; Series parallel graph; Single machine; Total weighted completion time

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

DETERIORATING JOBS; SERIES-PARALLEL GRAPH; SINGLE MACHINE; TOTAL WEIGHTED COMPLETION TIME;

OPERATIONS RESEARCH;

EID: 36849012070     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.12.026     Document Type: Article

References (22)

1. Alidaee B., and Womer N.K. Scheduling with time dependent processing processing times: review and extensions. Journal of the Operational Research Society 50 (1999) 711-720
2. 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
3. Browne S., and Yechiali U. Scheduling deteriorating jobs on a single processor. Operations Research 38 (1990) 495-498
4. Mosheiov G. V-shaped policies for scheduling deteriorating jobs. Operations Research 39 (1991) 979-991
5. Mosheiov G. Scheduling jobs under simple linear deterioration. Computers and Operations Research 21 (1994) 653-659
6. Sundararaghavan P.S., and Kunnathur A.S. Single machine scheduling with start time dependent processing times: some solvable cases. European Journal of Operational Research 78 (1994) 394-403
7. Cheng T.C.E., and Ding Q. The complexity of scheduling starting time dependent task with release dates. Information Processing Letters 65 (1998) 75-79
8. Bachman A., and Janiak A. Minimizing maximum lateness under linear deterioration. European Journal of Operational Research 126 (2000) 557-566
9. Bachman A., Janiak A., and Kovalyov M.Y. Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters 81 (2002) 81-84
10. 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
11. Hsu Y.S., and Lin B.M.T. Minimization of maximum lateness under linear deterioration. Omega 31 (2003) 459-469
12. Chen Z.-L. Parallel machine scheduling with time dependent processing times. Discrete Applied Mathematics 70 (1996) 81-94
13. Mosheiov G. Multi-machine scheduling with linear deterioration. INFOR 36 (1998) 205-214
14. Mosheiov G. Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics 117 (2002) 195-209
15. Wang J.-B., and Xia Z.-Q. Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34 (2006) 327-336
16. Wang J.-B., and Xia Z.-Q. Flow shop scheduling problems with deteriorating jobs under dominating machines. Journal of the Operational Research Society 57 (2006) 220-226
17. 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 Discrete Mathematics 5 (1979) 287-326
18. Lawler E.L. Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics 2 (1978) 75-90
19. Sidney J.B. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Operations Research 22 (1975) 283-298
20. Zhao C. Algorithms for some new classes of scheduling problems. PhD thesis, Northeastern University, China; 2003 [in Chinese].
21. Pinedo M. Scheduling: theory, algorithms, and systems (2002), Prentice-Hall, Englewood Cliffs, NJ
22. Brucker P. Scheduling algorithms. 3rd ed. (2001), Springer, Berlin