Better online algorithms for scheduling with machine cost

SIAM Journal on Computing

Volumn 33, Issue 5, 2004, Pages 1035-1051

  Dósa, György ^a   Yong, H E ^b  

^a UNIVERSITY OF PANNONIA   (Hungary)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Competitive analysis; Machine cost; Online algorithm; Parallel machine scheduling

Indexed keywords

ALGORITHMS; COMPETITIVE INTELLIGENCE; COMPUTER SIMULATION; COSTS; MACHINE COMPONENTS; MACHINE DESIGN; MARKETING; MATHEMATICAL MODELS; PROBLEM SOLVING; PROCESSING;

COMPETITIVE ANALYSIS; MACHINE COST; ONLINE ALGORITHMS; PARALLEL MACHINE SCHEDULING;

ONLINE SYSTEMS;

EID: 8344241149     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970343395X     Document Type: Article

References (16)

1. S. ALBERS, Better bounds for on-line scheduling, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, 1997, pp. 130-139.
2. Y. BARTAL, A. FIAT, H. KARLOFF, AND R. VOHRA, New algorithms for an ancient scheduling problem, J. Comput. System Sci., 51 (1995), pp. 359-366.
3. Y. BARTAL, H. KARLOFF, AND Y. RABANI, A better lower bound for on-line scheduling, Inform. Process. Lett., 50 (1994), pp. 113-116.
4. S. Y. CAI AND Y. HE, Quasi-online algorithms for scheduling non-increasing processing-time jobs with processor cost, Acta Automat. Sinica, 29 (2003), pp. 917-921 (in Chinese).
5. B. CHEN, A. VAN VLIET, AND G. WOEGINGER, New lower and upper bounds for on-line scheduling, Oper. Res. Lett., 16 (1994), pp. 221-230.
6. U. FAIGLE, W. KERN, AND G. TURAN, On the performance of on-line algorithm for partition problems, Acta Cybernet., 9 (1989), pp. 107-119.
7. G. GALAMBOS AND G. J. WOEGINGER, An on-line scheduling heuristic with better worst-case ratio than Graham's list scheduling, SIAM J. Comput., 22 (1993), pp. 349-355.
8. R. L. GRAHAM, Bounds for certain muliprocessing anomalies, Bell System Tech. J., 45 (1966), pp. 1563-1582.
9. Y. HE AND S. Y. CAI, Semi-online scheduling with machine cost, J. Comput. Sci. Tech., 17 (2002), pp. 781-787.
10. Y. HE AND G. ZHANG, Semi-online scheduling on two identical machines, Computing, 62 (1999), pp. 179-187.
11. C. IMREH AND J. NOGA, Scheduling with machine cost, in Proceedings of RANDOM-APPROX'99, Lecture Notes in Comput. Sci. 1671, Springer-Verlag, New York, 1999, pp. 168-176.
12. D. R. KARGER, S. J. PHILLIPS, AND E. TORNG, A better algorithm for an ancient scheduling problem, J. Algorithms, 20 (1996), pp. 400-430.
13. H. KELLERER, V. KOTOV, M. R. SPERANZA, AND Z. TUZA, Semi on-line algorithms for the partition problem, Oper. Res. Lett., 21 (1997), pp. 235-242.
14. J. F. RUDIN III AND R. CHANDRASEKARAN, Improved bounds for the online scheduling problem, SIAM J. Comput., 32 (2003), pp. 717-735.
15. S. SEIDEN, A guessing game and randomized online algorithms, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 592-601.
16. S. SEIDEN, J. SGALL, AND G. WOEGINGER, Semi-online scheduling with decreasing job sizes, Oper. Res. Lett., 27 (2000), pp. 215-221.