Semi-on-line scheduling problems for maximizing the minimum machine completion time

Acta Mathematicae Applicatae Sinica

Volumn 17, Issue 1, 2001, Pages 107-113

  He, Yong ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Analysis of algorithm; On line; Worst case analysis

Indexed keywords

EID: 0000374240     PISSN: 01689673     EISSN: 16183932     Source Type: Journal    
DOI: 10.1007/bf02669690     Document Type: Article

References (12)

1. M.R. Garey, D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1978
2. D.K. Friesen, B.L. Deuermeryer. Analysis of Greedy Solutions for a Replacement Part Sequencing Problem. Math. Oper. Res., 1981, 6: 74-87
3. B.L. Deuermeryer, D.K. Friesen, M.A. Langsten. Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System. SIAM J. Algorithms Discrete Methods, 1982, 3: 190-196
4. J. Csirik, H. Kellerer, G. Woeginger. The Exact LPT-bound for Maximizing the Minimum Completion Time. Oper. Res. Letters, 1992, 11: 281-287
5. G. Woeginger. A Polynomial Time Approximation Scheme for Maximizing the Minimum Machine Completion Time. Oper. Res. Letters, 1997, 20: 149-154
6. Y. Azar, L. Epstein. On-line Machine Covering. Algorithms-ESA'97, Lecture Notes in Computer Science 1284, Springer-Verlag, Austria, 1997, 23-36
7. R.L. Graham. Bounds for Certain Multiprocessor Anomalies. Bell System Technical Journal, 1966, 45: 1563-1581
8. U. Faigle, W. Kern, G. Turán. On the Performance of On-line Algorithm for Particular Problems. Acta Cybernetica, 1989, 9: 107-119
9. Y. He, G.C. Zhang. Semi On-line Scheduling on Two Identical Machines. Computing, 1999, 62: 179-187
10. W.P. Liu, J.B. Sidney, A. van Vliet. Ordinal Algorithms for Parallel Machine Scheduling. Oper. Res. Letters, 1996, 18: 223-232
11. H. Kellerer, V. Kotov, M.G. Speranza, Z. Tuza. Semi-on-Line Algorithms for the Partition Problem. Oper. Res. Letters, 1997, 21: 235-242
12. max with a Buffer. Information Processing Letters, 1997, 61: 145-148