Semi on-line scheduling problem for maximizing the minimum machine completion time on m identical machines

Journal of Shanghai University

Volumn 9, Issue 2, 2005, Pages 99-102

  Luo, Run Zi ^a   Sun, Shi Jie ^a  

^a SHANGHAI UNIVERSITY   (China)

Author keywords

scheduling; semi on line; worst case ratio

Indexed keywords

EID: 84867989531     PISSN: 10076417     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11741-005-0058-2     Document Type: Article

References (6)

1. Garey M R, Johnson D S. Computers and Intractability [M]. W. H. Freeman and Company, San Francisco, 1979.
2. G Woeginger 1997 A polynomial time approximation scheme for minimizing the minimum machine completion time [J] Oper. Res. Letters 20 149 154 0879.90121 10.1016/S0167-6377(96)00055-7 1452078
3. B L Deuermeryer D K Friesen M A Langston 1982 Scheduling to maximize the minimum processor finish time in a multiprocessor system[J] SIAM J. Algorithms Discrete Methods 3 190 196
4. J Csirik H Kellerer G Woeginger 1992 The exact LPT-bound for maximizing the minimum completion time[J] Oper. Res. Letters 11 281 287 0767.90034 10.1016/0167-6377(92)90004-M 1183679
5. Azar Y, Epstein L. On-line Machine Covering [A]. Algorithms-ESA'97, Lecture Notes in Computer Science 1284[C]. Springer-Verlag, 1997, 23-36.
6. Y He 2001 Semi on-line scheduling problem for maximizing the minimum machine completion time [J] Acta Mathematica Applicate Sinica 17 107 113 0973.68016