Parallel machine scheduling problems with proportionally deteriorating jobs

International Journal of Systems Science

Volumn 40, Issue 1, 2009, Pages 53-57

  Cheng, Mingbao ^a   Wang, Guoqing ^a   He, Longmin ^b  

^a JINAN UNIVERSITY   (China)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

Algorithm; Deteriorating jobs; Identical parallel machines; NP hardness; Scheduling

Indexed keywords

BUSINESS MACHINES; DETERIORATION; HARDNESS; HEURISTIC ALGORITHMS; SCHEDULING;

DETERIORATING JOBS; IDENTICAL MACHINES; IDENTICAL PARALLEL MACHINES; MAKESPAN; MINIMUM MACHINE COMPLETIONS; NP-HARD; NP-HARDNESS; OPTIMALITY; PARALLEL MACHINE-SCHEDULING PROBLEMS; PROCESSING TIME; SCHEDULING PROBLEMS;

PARALLEL ALGORITHMS;

EID: 60749136592     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/00207720802095160     Document Type: Article

References (15)

1. Browne, S., and Yechiali, U. (1990), "Scheduling Deteriorating Jobs on Single Processor," Operations Research, 38, 495-498.
2. Gupta, J.N.D., and Gupta, S.K. (1988), "Single Facility Scheduling with Non-linear Processing Time," Computer & Industrial Engineering, 14, 387-393.
3. Mosheiov, G. (1994), "Scheduling Job Under Simple Linear Deterioration," Computers & Operations Research, 21, 653-659.
4. Alidaee, B., and Womer, N.K. (1999), "Scheduling with Time Dependent Processing Times: Review and Extensions," Journal of the Operational Research Society, 150, 711-720.
5. Cheng, T.C.E., Ding, Q., and Lin, B.M.T. (2004), "A Concise Survey of Scheduling with Time-dependent Processing Times," European Journal of Operational Research, 152, 1-13.
6. Kononov, A. (1997), "Scheduling Problems with Linear increasing Processing Times," Operations Research Proceedings, Berlin: Springer, pp. 199-206.
7. Mosheiov, G. (1998), "Multi-machine Scheduling with Linear Deterioration," INFOR, 36, 205-214.
8. Hsieh, Y.C., and Bricker, D.L. (1997), "Scheduling Linearly Deteriorating Jobs on Multiple Machines," Computers & Industrial Engineering, 32, 727-734.
9. Chen, Z.-L. (1996), "Parallel Machine Scheduling with Time Dependent Processing Times," Discrete Applied Mathematics, 70, 81-93.
10. Graham, R.L., Lawler, EL., Lenstra, J.K., and Rinnooy Kan, A.H.G. (1979), "Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey," Annals of Discrete Mathematics, 5, 287-326.
11. Graham, R.L. (1969), "Bounds on Multiprocessing Timing anomalies," SIAM Journal of Applied Mathematics, 17, 416-429.
12. Hall, L.A. (1997), "Approximation Algorithms for Scheduling," in Approximation algorithms for NP-hard problems, ed. D.S. Hochbaum, Boston: PWS, pp. 1-45.
13. Deuermeyer, B.L., Friesen, D.K., and Langston, M.A. (1982), "Scheduling to Maximise the Minimum Processor Finish Time in a Multiprocessor System," SIAM Journal of Algorithm Discrete Method, 3, 190-196.
14. Csirik, J., Kellerer, H., and Woeginger, G. (1992), "The Exact LPT-bound for Maximising the Minimum Completion Time," Operations Research Letters, 11, 281-287.
15. Woeginger, G. (1997), "A Polynomial Time Approximation Scheme for Maximising the Minimum Machine Completion Time," Operation Research Letters, 20, 149-154.