Optimal semi-online algorithms for machine covering

Theoretical Computer Science

Volumn 372, Issue 1, 2007, Pages 69-80

  Tan, Zhiyi ^a   Wu, Yong ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Competitive ratio; Design and analysis of algorithms; Scheduling; Semi online

Indexed keywords

ALGORITHMS; DATA PROCESSING; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

COMPETITIVE RATIO; MACHINE COVERING PROBLEMS; SEMI-ONLINE;

ONLINE SYSTEMS;

EID: 33846922253     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.11.015     Document Type: Article

References (15)

1. Azar Y., and Epstein L. On-line machine covering. Journal of Scheduling 1 (1998) 67-77
2. Azar Y., and Regev O. On-line bin-stretching. Theoretical Computer Science 168 (2001) 17-41
3. Cheng T.C.E., Kellerer H., and Kotov V. Semi-on-line multiprocessor scheduling with given total processing time. Theoretical Computer Science 337 (2005) 134-146
4. Csirik J., Kellerer H., and Woeginger G. The exact LPT-bound for maximizing the minimum completion time. Operations Research Letters 11 (1992) 281-287
5. Deuermeyer B., Friesen D., and Langston M. Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM Journal on Algebraic and Discrete Methods 3 (1982) 190-196
6. Dósa G., and He Y. Semi-online agorithms for parallel machine scheduling problems. Computing 72 (2004) 355-363
7. Epstein L. Bin stretching revisited. Acta Informatica 39 (2003) 97-117
8. He Y. Semi on-line scheduling problem for maximizing the minimum machine completion time. Acta Mathematica Applicatae Sinica 17 (2001) 107-113
9. He Y. The optimal on-line parallel machine scheduling. Computers & Mathematics with Applications 39 (2000) 117-121
10. He Y., and Tan Z.Y. Randomized on-line and semi-on-line scheduling on identical machines. Asia-Pacific Journal of Operations Research 20 (2003) 31-40
11. He Y., and Zhang G.C. Semi on-line scheduling on two identical machines. Computing 62 (1999) 179-187
12. Kellerer H., Kotov V., Speranza M.G., and Tuza Z. Semi on-line algorithms for the partition problem. Operations Research Letters 21 (1997) 235-242
13. Seiden S., Sgall J., and Woeginger G. Semi-online scheduling with decreasing job sizes. Operations Research Letters 27 (2000) 215-227
14. Tan Z.Y., and He Y. Semi-on-line problems on two identical machines with combined partial information. Operations Research Letters 30 (2002) 408-414
15. Woeginger G. A polynomial time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters 20 (1997) 149-154