Single machine scheduling with decreasing linear deterioration under precedence constraints

Computers and Mathematics with Applications

Volumn 58, Issue 1, 2009, Pages 95-103

  Wang, Ji Bo ^a  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

Author keywords

Deteriorating jobs; Makespan; Parallel chains; Scheduling; Series parallel graph; Single machine

Indexed keywords

DETERIORATING JOBS; MAKESPAN; PARALLEL CHAINS; SERIES-PARALLEL GRAPH; SINGLE MACHINE;

DETERIORATION; MACHINERY;

CHAINS;

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

References (23)

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. Ho K.I.-J., Leung J.Y.-T., and Wei W.-D. Complexity of scheduling tasks with time-dependent execution times. Information Processing Letters 48 (1993) 315-320
4. Browne S., and Yechiali U. Scheduling deteriorating jobs on a single processor. Operations Research 38 (1990) 495-498
5. Mosheiov G. V-shaped policies for scheduling deteriorating jobs. Operations Research 39 (1991) 979-991
6. Mosheiov G. Scheduling jobs under simple linear deterioration. Computers and Operations Research 21 (1994) 653-659
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. Hsu Y.S., and Lin B.M.T. Minimization of maximum lateness under linear deterioration. Omega 31 (2003) 459-469
11. Chen Z.-L. Parallel machine scheduling with time dependent processing times. Discrete Applied Mathematics 70 (1996) 81-94
12. Mosheiov G. Multi-machine scheduling with linear deterioration. INFOR 36 (1998) 205-214
13. Mosheiov G. Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics 117 (2002) 195-209
14. Wang J.-B., and Xia Z.-Q. Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34 (2006) 327-336
15. Wang J.-B., Ng C.T., and Cheng T.C.E. Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Computers and Operations Research 35 (2008) 2684-2693
16. Ng C.T., Cheng T.C.E., Bachman A., and Janiak A. Three scheduling problems with deteriorating jobs to minimize the total completion time. Information Processing Letters 81 (2002) 327-333
17. Bachman A., Cheng T.C.E., Janiak A., and Ng C.T. Scheduling start time dependent jobs to minimize the total weighted completion time. Journal of the Operational Research Society 53 (2002) 688-693
18. Wang J.-B., and Xia Z.-Q. Scheduling jobs under decreasing linear deterioration. Information Processing Letters 94 (2005) 63-69
19. Brucker P. Scheduling Algorithms. Third Edition (2001), Springer
20. Pinedo M. Scheduling: Theory, Algorithms, and Systems (2002), Prentice Hall
21. 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
22. Sidney J.B. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Operations Research 22 (1975) 283-298
23. Lawler E.L. Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics 2 (1978) 75-90