Makespan minimization for two uniform parallel machines

International Journal of Production Economics

Volumn 84, Issue 2, 2003, Pages 205-213

  Liao, Ching Jong ^a   Lin, Chien Hung ^a,b  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b JINWEN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Makespan; Scheduling; Uniform machines

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MACHINE DESIGN; OPTIMIZATION; SCHEDULING;

UNIFORM PARALLEL MACHINES;

PRODUCTION ENGINEERING;

EID: 0037432978     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(02)00427-9     Document Type: Article

References (13)

1. Coffman E.G., Garey M.R., Johnson D.S. An application of bin-packing to multiprocessor scheduling. SIAM Journal of Computing. 7:1978;1-17.
2. Dobson G. Scheduling independent tasks on uniform processors. SIAM Journal of Computing. 13:1984;705-716.
3. Friesen D.K. Tighter bounds for LPT scheduling on uniform processors. SIAM Journal of Computing. 16:1987;554-560.
4. Friesen D.K., Langston M.A. Bounds for Multifit scheduling on uniform processors. SIAM Journal of Computing. 12:1983;60-70.
5. Garey M.R., Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness:1979;Freeman, San Francisco.
6. Gonzalez T., Ibarra O.H., Sahni S. Bounds for LPT schedules on uniform processors. SIAM Journal of Computing. 6:1977;155-166.
7. Graham R.L. Boundaries on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics. 17:1969;416-429.
8. Gupta J.N.D., Ho J.C. Minimizing makespan subject to minimum flowtime on two identical parallel machines. Computers and Operations Research. 28:2001;705-717.
9. Gupta J.N.D., Ho J.C., Webster S. Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines. Journal of the Operational Research Society. 51:2000;1330-1339.
10. Ho J.C., Wong J.S. Makespan minimization for m parallel identical processors. Naval Research Logistics. 42:1995;935-948.
11. Hochbaum D., Shmoys D. A polynomial approximation scheme for machine scheduling on uniform processors. using the dual approximation approach SIAM Journal of Computing. 17:1988;539-551.
12. Horowitz E., Sahni S. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM. 23:1976;317-327.
13. Mireault P., Orlin J.B., Vohra R.V. A parametric worst case analysis of the LPT heuristic for two uniform machines. Operations Research. 45(1):1997;116-125.