Parallel machine scheduling with time dependent processing times

Discrete Applied Mathematics

Volumn 70, Issue 1, 1996, Pages 81-93

  Chen, Zhi Long ^a  

^a Princeton University   (United States)

Author keywords

Heuristic; Parallel machine scheduling; Strong NP hardness; Time dependent processing times; Worst case bound

Indexed keywords

EID: 0003051113     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(96)00102-3     Document Type: Article

References (10)

1. S. Browne and U. Yechiali, Scheduling deteriorating jobs on a single process, Oper. Res. 38 (1990) 495-498.
2. Z.-L. Chen, A note on single-processor scheduling with time-dependent execution times, Oper. Res. Lett., 17 (1995) 127-129.
3. MR. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
4. K.I.-J. Ho, J.Y.-T. Leung and W.-D. Wei, Complexity of scheduling tasks with time-dependent execution times, Inform. Process. Lett. 48 (1993) 315-320.
5. W. Kubiak and S.L. van de Velde, Scheduling deteriorating jobs to minimize makespan, Working paper, Laboratory of Production and Operation Management, Department of Mechanical Engineering, University of Twente, The Netherlands, 1994.
6. A.S. Kunnathur and S.K. Gupta, Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem, European J. Oper. Res. 47 (1990) 56-64.
7. G. Mosheiov, V-Shaped policies to schedule deteriorating jobs, Oper. Res. 39 (1991) 979-991.
8. G. Mosheiov, Scheduling jobs under simple linear deterioration, Comput. Oper. Res. 21 (1994) 653-659.
9. G. Mosheiov, Multi-machine scheduling with linear deterioration, Working paper, School of Business Administration, The Hebrew University, Jerusalem, Israel, 1995.
10. P.S. Sundararaghavan and A.S. Kunnathur, Single machine scheduling with start time dependent processing times: some solvable cases, European J. Oper. Res. 78 (1994) 394-403.