Makespan minimization for multiple uniform machines

Computers and Industrial Engineering

Volumn 54, Issue 4, 2008, Pages 983-992

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

^a JINWEN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

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

Author keywords

Makespan; Scheduling; Uniform machines

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; THEOREM PROVING;

MAKESPAN; PARALLEL MACHINES; UNIFORM MACHINES;

SCHEDULING ALGORITHMS;

EID: 41449087604     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.11.009     Document Type: Article

References (13)

1. Dessouky M.M. Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness. Computers and Industrial Engineering 34 (1998) 793-806
2. Dobson G. Scheduling independent tasks on uniform processors. SIAM Journal on Computing 13 (1984) 705-716
3. Friesen D.K. Tighter bounds for LPT scheduling on uniform processors. SIAM Journal on Computing 16 (1987) 554-560
4. Friesen D.K., and Langston M.A. Bounds for multifit scheduling on uniform processors. SIAM Journal on Computing 12 (1983) 60-70
5. Garey M.R., and Johnson D.S. Computers and intractability: A guide to the theory of NP-completeness (1979), Freeman, San Francisco
6. Gonzalez T., Ibarra O.H., and Sahni S. Bounds for LPT schedules on uniform processors. SIAM Journal on Computing 6 (1977) 155-166
7. Graham R.L. Boundaries on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics 17 (1969) 416-429
8. Hochbaum D.S., and Shmoys D.B. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing 17 (1988) 539-551
9. Horowitz E., and Sahni S. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the Association for Computing Machinery 23 (1976) 317-327
10. Liao C.J., and Lin C.H. Makespan minimization for two uniform parallel machines. International Journal of Production Economics 84 (2003) 205-213
11. Lin C.H., and Liao C.J. Makespan minimization subject to flowtime optimality on identical parallel machines. Computers and Operations Research 31 (2004) 1655-1666
12. Mireault P., Orlin J.B., and Vohra R.V. A parametric worst case analysis of the LPT heuristic for two uniform machines. Operations Research 45 (1997) 116-125
13. Ruiz-Torres A.J., López F.J., and Ho J.C. Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs. European Journal of Operational Research 179 (2007) 302-315