Randomized on-line and semi-on-line scheduling on identical machines

Asia-Pacific Journal of Operational Research

Volumn 20, Issue 1, 2003, Pages 31-40

  He, Yong ^a   Tan, Zhiyi ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Analysis of algorithm; Competitive ratio; On line scheduling; Randomized algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

COMPETITIVE RATIO; ON-LINE SCHEDULING;

OPERATIONS RESEARCH;

EID: 0344084262     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. Azar, Y. and L. Epstein (1997), On-line machine covering, Algorithms-ESA'97, Lecture Notes in Computer Science 1284, Springer Verlag, 23-36.
2. Bartal, Y., A. Fiat, H. Karloff and R. Vohra (1995), New algorithms for an ancient scheduling problem, Journal of Computer and System Science 51, 359-366.
3. Csirik, J., H. Kellerer and G. Woeginger (1992), The exact LPT-bound for maximizing the minimum machine completion time, Operations Research Letters 11, 281-287.
4. Friesen, D. and B. Deuermeyer (1981), Analysis of greedy solutions for a replacement part sequencing problem, Mathematics of Operation Research 6, 74-87.
5. Garey, M. R. and D. S. Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco.
6. He, Y. (2001), Semi on-line scheduling problem for maximizing the minimum machine completion time, Acta Mathematica Applicatae Sinica 17, 107-113.
7. He, Y. (2000), The optimal on-line parallel machine scheduling, Computers & Mathematics with Applications 39, 117-121.
8. Seiden, S., J. Sgall and G. Woeginger (2000), Semi online scheduling with decreasing job sizes, Operations Research Letters 27, 215-221.
9. Sgall, J. (1997), A lower bound for randomized on-line multiprocessor scheduling, Information Processing Letters 63, 51-55.
10. Sgall, J. (1998), On-line scheduling, in A. Fiat and G. Woeginger, eds.: Online Algorithms: The State of Art, Lecture Notes in Computer Science 1442, Springer Verlag, 196-231.
11. Seiden, S. (2000), Online randomized multiprocessor scheduling, Algorithimica 28, 173-216.
12. Woeginger, G. (1997), A polynomial time approximation scheme for maximizing the minimum machine completion time, Operations Research Letters 20, 149-154.