Optimal semi-online preemptive algorithms for machine covering on two uniform machines

Theoretical Computer Science

Volumn 339, Issue 2-3, 2005, Pages 293-314

  He, Yong ^a,b   Jiang, Yiwei ^a,b  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Competitive ratio; Machine covering; Online algorithm; Preemptive scheduling

Indexed keywords

BOUNDARY CONDITIONS; MACHINE COMPONENTS; PROBLEM SOLVING; PRODUCT DESIGN; SCHEDULING; SET THEORY;

COMPETITIVE RATIO; MACHINE COVERING; ONLINE ALGORITHMS; PREEMPTIVE SCHEDULING;

ALGORITHMS;

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

References (27)

1. Y. Azar, L. Epstein, On-line machine covering, Proc. ESA'97, Lecture Notes in Computer Science, Vol. 1284, Springer, Berlin, 1997, pp. 23-36.
2. Y. Azar, L. Epstein, Approximation schemes for covering and scheduling on related machines, Proc. First APPROX, Denmark, 1998, pp. 39-47.
3. Y. Azar, and O. Regev Online bin stretching Theoret. Comput. Sci. 268 2001 17 41
4. B. Chen, A. van Vliet, and G. Woeginger An optimal algorithm for preemptive on-line scheduling Oper. Res. Lett. 18 1995 127 131
5. J. Csirik, H. Kellerer, and G. Woeginger The exact LPT-bound for maximizing the minimum completion time Oper. Res. Lett. 11 1992 281 287
6. B. Deuermeyer, D. Friesen, and M. Langston Scheduling to maximize the minimum processor finish time in a multiprocessor system SIAM J. Discrete Methods 3 1982 190 196
7. L. Epstein, Tight bounds for online bandwidth allocation on two links, Proc. of the Third Workshop on Approximation and Randomization Algorithms in Communication Networks, Rome, 2002, pp. 39-50.
8. L. Epstein Bin stretching revisited Acta Inform. 39 2003 97 117
9. L. Epstein, and L. Favrholdt Optimal preemptive semi-online scheduling to minimize makespan on two related machines Oper. Res. Lett. 30 2002 269 275
10. L. Epstein, J. Noga, S. Seiden, J. Sgall, and G. Woeginger Randomized on-line scheduling on two uniform machines J. Schedul. 4 2001 71 92
11. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Ann. Oper. Res. 5 1979 287 326
12. T. Gonzalez, and S. Sahni Preemptive scheduling of uniform processor systems J. Assoc. Comput. Mach. 25 1978 92 101
13. Y. He The optimal on-line parallel machine scheduling Comput. Math. Appl. 39 2000 117 121
14. Y. He, and Z.Y. Tan Ordinal on-line scheduling for maximizing the minimum machine completion time J. Combin. Optim. 6 2002 199 206
15. Y. He, and Z.Y. Tan Randomized on-line and semi-on-line scheduling on identical machines Asia-Pacific J. Oper. Res. 20 2003 31 40
16. Y. He, and G. Zhang Semi on-line scheduling on two identical machines Computing 62 1999 179 187
17. E.C. Horvath, S. Lam, and R. Sethi A level algorithm for preemptive scheduling J. Assoc. Comput. Mach. 24 1977 32 43
18. Y.W. Jiang, Z.Y. Tan, Y. He, Preemptive machine covering on parallel machines, Technical Report, Department of Mathematics, Zhejiang University, 2003.
19. H. Kellerer, V. Kotov, M.R. Speranza, and Z. Tuza Semi on-line algorithms for the partition problem Oper. Res. Lett. 21 1997 235 242
20. W.P. Liu, J.B. Sidney, and A. van Vliet Ordinal algorithms for parallel machine scheduling Oper. Res. Lett. 18 1996 223 232
21. K. Pruhs, J. Sgall, and E. Torng Online scheduling J.Y.-T. Leung Handbook of Scheduling 2004 Chapman & Hall/CRC Press London/Boca Raton, FL
22. S. Seiden, J. Sgall, and G. Woeginger Semi-online scheduling with decreasing job sizes Oper. Res. Lett. 27 2000 215 221
23. J. Sgall A lower bound for randomized on-line multiprocessor scheduling Inform. Process. Lett. 63 1997 51 55
24. Z. Tan, and Y. He Semi-on-line problems on two identical machines with combined partial information Oper. Res. Lett. 30 2002 408 414
25. Z. Tan, and Y. He Semi-on-line scheduling with ordinal data on two uniform machines Oper. Res. Lett. 28 2001 221 231
26. J. Wen, and D. Du Preemptive on-line scheduling for two uniform processors Oper. Res. Lett. 23 1998 113 116
27. G. Woeginger A polynomial time approximation scheme for maximizing the minimum machine completion time Oper. Res. Lett. 20 1997 149 154