Due-date assignment and parallel-machine scheduling with deteriorating jobs

Journal of the Operational Research Society

Volumn 58, Issue 8, 2007, Pages 1103-1108

  Cheng, T C E ^a   Kang, L Y ^a,b   Ng, C T ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

Deteriorating jobs; Due date; Parallel machine scheduling

Indexed keywords

HEURISTIC ALGORITHMS; JOB ANALYSIS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

DETERIORATING JOBS; NONDECREASING FUNCTIONS; PARALLEL MACHINE SCHEDULING; TARDINESS PENALTIES;

SCHEDULING;

EID: 34547359924     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602225     Document Type: Article

References (21)

1. Alidaee B and Ahmadian A (1993). Two parallel machine sequencing problems involving controllable job processing times. Eur J Opt Res 70: 335-341.
2. Bachman A and Janiak A (2000). Minimizing maximum lateness under linear deterioration. Eur J Opl Res 126: 557-566.
3. Bachman A, Janiak A and Kovalyov MY (2002). Minimizing the total weighted completion time of deteriorating jobs. Inform Process Lett 81: 81-84.
4. Baker KR and Scudder GD (1990). Sequencing with earliness and tardiness penalties: a review. Opns Res 38: 22-36.
5. Browne S and Yechiali U (1990). Scheduling deteriorating jobs on a single processor. Opns Res 38: 495-498.
6. Cheng TCE (1989). A heuristic for common due-date assignment and job scheduling on parallel machines. J Opl Res Soc 40: 1129-1135.
7. Cheng TCE and Chen ZL (1994). Parallel-machines scheduling problems with earliness and tardiness penalties. J Opl Res Soc 45: 685-695.
8. Cheng TCE and Ding Q (2000). Single machine scheduling with deadlines and increasing rates of processing times. Acta Informatica 36: 673-692.
9. Cheng TCE, Chen ZL and Shakhlevich NV (2002). Common due date assignment and scheduling with ready times. Comput Opns Res 29: 1957-1967.
10. Cheng TCE, Kang LY and Ng CT (2004a). Due-date assignment and single machine scheduling with deteriorating jobs. J Opl Res Soc 55: 198-203.
11. Cheng TCE, Ding Q and Lin BMT (2004b). A concise survey of scheduling with time-dependent processing times. Eur J Opl Res 152: 1-13.
12. De P, Ghosh JB and Wells CE (1994). Due-date assignment and early/tardy scheduling on identical parallel machines. Naval Res Logist 41: 17-32.
13. Emmons H (1987). Scheduling to a common due date on parallel uniform processors. Naval Res Logist Q 34: 803-810.
14. Gordon VS, Proth JM and Chu CB (2002a). A survey of the state-of-the-art of common due date assignment and scheduling research. Eur J Opl Res 139: 1-25.
15. Gordon VS, Proth JM and Chu CB (2002b). Due date assignment and scheduling: SLK, TWK and other due date assignment models. Product Planning Control 13: 117-132.
16. Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5: 287-326.
17. Hsieh YC and Bricker DL (1997). Scheduling linearly deteriorating jobs on multiple machines. Comput Indust Eng 32: 727-734.
18. Kubiak W and van de Velde SL (1998). Scheduling deteriorating jobs to minimize makespan. Naval Res Logist 45: 511-523.
19. 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.
20. Ng CT, Cheng TCE, Bachman A and Janiak A (2002). Three scheduling problems with deteriorating jobs to minimize the total completion time. Inform Process Lett 81: 327-333.
21. Panwalker SS, Smith ML and Seidmann A (1982). Common due date assignment to minimize total penalty for one machine scheduling problem. Opns Res 30: 391-399.