Multi-machine scheduling with linear deterioration

INFOR

Volumn 36, Issue 4, 1998, Pages 205-214

  Mosheiov, Gur ^a,b,c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Deteriorating jobs; Deterministic scheduling; Heuristics; Multiple machine

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

DETERMINISTIC SCHEDULING; MULTIPLE MACHINE SCHEDULING; PARALLEL IDENTICAL MACHINES;

DATA COMMUNICATION SYSTEMS;

EID: 0032204974     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.1998.11732359     Document Type: Article

References (17)

1. K. Baker, Introduction to Sequencing and Scheduling. John Wiley, NY (1975).
2. S. Browne and U. Yechiali, "Scheduling deteriorating jobs on a single processor", Operations Research, Vol. 38, No. 3, pp. 495-498 (1990).
3. Z-L Chen, "Parallel machine scheduling with time dependent processing times", Discrete Applied Math., Vol. 70, pp. 81-94 (1996).
4. Z-L Chen, "A Note on single-processor scheduling with time-dependent execution times", Operations Research Letters, Vol. 17, pp. 127-129 (1995).
5. J. B. Frenk and A. H. G. Rinnooy Kan, "The asymptotic optimality of the LPT rule", Math. of Operations Research, Vol. 12, pp. 241-254 (1987).
6. M. R. Garey and D. S. Johnson, "Strong NP-completeness results: Motivation, examples and implications", J. Assoc. Comput. Mach., Vol. 25, pp. 499-508 (1978).
7. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979).
8. J. N. D. Gupta and S. K. Gupta, "Single facility scheduling with nonlinear processing times", Computers and Industrial Engineering, Vol. 14, No. 4, pp. 387-393 (1988).
9. K. I.-J Ho, J.Y-T. Leung and W-D. Wei, "Complexity of scheduling tasks with time-dependent execution times", Inform. Process. Letters, Vol. 48, pp. 315-320 (1993).
10. D. S. Johnson, "The NP-Completeness Column: An Ongoing Guide", Journal of Algorithms, Vol. 4, pp. 393-405 (1981).
11. W. Kubiak and S. L. van de Velde, "Scheduling deteriorating jobs to minimize makespan", Naval Research Logistics, Vol. 45, pp. 511-523 (1998).
12. 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 Journal of Operational Research, Vol. 47, pp. 56-64 (1990).
13. G. Mosheiov, "V-Shaped policies to schedule deteriorating jobs", Operations Research, Vol. 39, No. 6, pp. 979-991 (1991).
14. G. Mosheiov, "Scheduling deteriorating jobs under simple linear deterioration", Computers and Operations Research, Vol. 21, No. 6, pp. 653-659 (1994).
15. G. Mosheiov, "Scheduling jobs with step-deterioration: minimizing makespan on single and multi-machine", Computers and Industrial Engineering, Vol. 28, No. 4, pp. 869-879 (1995).
16. G. Mosheiov, "A-Shaped policies to schedule deteriorating jobs", Journal of The Operational Research Society, Vol. 47, pp. 1184-1191 (1996).
17. P. S. Sundararaghavan and A. S. Kunnathur, "Single machine scheduling with start time dependent processing times: some solvable cases", European Journal of Operational Research, Vol. 78, pp. 394-403 (1994).