Makespan minimization in single-machine scheduling with step-deterioration of processing times

Journal of the Operational Research Society

Volumn 55, Issue 3, 2004, Pages 247-256

  Jeng, A A K ^a   Lin, B M T ^a,b  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^b Natioml Chi Nan University   (Taiwan)

Author keywords

Branch and bound; Dynamic programming; Makespan; Single machine scheduling; Step deterioration

Indexed keywords

ALGORITHMS; ECONOMICS; OPERATIONS RESEARCH; POLYNOMIALS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

BRANCH AND BOUND; MAKESPAN; SINGLE MACHINE SCHEDULING; STEP DETERIORATION;

DYNAMIC PROGRAMMING;

EID: 2342514890     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601693     Document Type: Article

References (19)

1. Gupta SK, Kunnathur AS and Dandapai K (1987). Optimal repayment policies for multiple loans. OMEGA 15: 323-330.
2. Tanaev VS, Gordon VS and Shafransky YM (1994). Schedule Theory, Single-stage Systems, Kluwer: Dordrecht, Germany.
3. Gupta JND and Gupta SK (1988). Single facility scheduling with nonlinear processing time. Comput Ind Eng 14: 387-393.
4. Mosheiov G (1991). V-shaped policies to schedule deteriorating jobs. Opns Res 39: 979-991.
5. Chen ZL (1995). A note on single-processor scheduling with time-dependent execution times. Op Res Lett 17: 127-129.
6. Chen ZL (1996). Parallel machine scheduling with time-dependent processing times. Discrete Appl Math 70: 81-93.
7. Cheng TCE and Ding Q (1998). The complexity of single machine with release times. Inf Process Lett 65: 95-100.
8. Cheng TCE and Ding Q (2000). Single machine scheduling with deadlines and increasing rate of processing times. Acta Inf 36: 673-692.
9. Mosheiov G (1996). A-shaped polices to schedule deteriorating jobs. J Opl Res Soc 47: 1184-1191.
10. Cheng TCE and Ding Q (2001). Single machine scheduling with step-deteriorating processing times. Eur J of Opl Res 134: 623-630.
11. Mosheiov G (1995). Scheduling jobs with step-deterioration: minimizing makespan on a single and multi-machine. Comput Ind Eng 28: 869-879.
12. Kubiak W and van de Velde SL (1998). Scheduling deteriorating jobs to minimize makespan. Naval Res Logistics 45: 511-523.
13. Sundararaghavan PS and Kunnathur AS (1994). Single machine scheduling with start time dependent processing times: some solvable cases. Eur J Opl Res 79: 394-403.
14. Cheng TCE et al (2003). Scheduling jobs with piecewise linear dereasing processing times. Naval Res Logistics 50: 531-554.
15. Kunnathur AS and Gupta SK (1990). Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. Eur J Opl Res 47: 56-64.
16. Alidaee B and Womer NK (1999). Schedule with time dependent processing times: review and extensions. J Opl Res Soc 50: 711-720.
17. Cheng TCE, Ding Q and Lin BMT (2004). A concise survey of scheduling with time-dependent processing times. Eur J Opl Res 152: 1-13
18. Hsu YS and Lin BMT (2003). Algorithms for the minimization of maximum lateness under linear deterioration. OMEGA 31: 459-469.
19. Graham RL, Lawler EL, Lenstra JK and Rinooy Kan AHG (1976). Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5: 287-326.