Yair Bartal, Amos Fiat, Howard Karloff, Rakesh Vohra  Home/Search
Context Related
| berkeley.edu/~yair...BFKVscheduling.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~yairb/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the on-line version of the original m-machine scheduling problem: given m machines and n positive real jobs, schedule the n jobs on the m machines so as to minimize the makespan, the completion time of the last job. In the on-line version, as soon as job j arrives, it must be assigned immediately to one of the m machines. We present two main results. The first is a (2 \Gamma ffl)-competitive deterministic algorithm for all m. The competitive ratio of all previous algorithms... (Update)
Cited by: More
Randomized On-Line scheduling similar jobs to minimize makespan on.. - Du (2004) (Correct)
Improved Bounds for On-line Load Balancing - Matthew Andrews Andrews (1996) (Correct)
Online Scheduling with Bounded Migration - Sanders, Sivadasan, Skutella (2004) (Correct)
Active bibliography (related documents): More All
0.3: A Better Lower Bound for On-Line Scheduling - Bartal, Karloff, Rabani (1994) (Correct)
0.2: Multiprocessor Scheduling with Rejection - Bartal, Leonardi.. (1996) (Correct)
0.2: On-line Resource Management with Application to.. - Leonardi.. (1995) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.4: Barely Random Algorithms for Multiprocessor Scheduling - Seiden (1999) (Correct)
0.3: Better Bounds For Online Scheduling - Albers (1997) (Correct)
0.3: A Better Algorithm For an Ancient Scheduling Problem - Karger, Phillips, Torng (1996) (Correct)
Related documents from co-citation: More All
64: A better algorithm for an ancient scheduling problem - KARGER, PHILLIPS et al. - 1996
52: Bounds for certain multiprocessing anomalies (context) - Graham - 1966
36: The competitiveness of on-line assignments - Azar, Naor et al. - 1992
BibTeX entry: (Update)
Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New Algorithms for an Ancient Scheduling Problem. In Proceedings of 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 51--58. http://citeseer.ist.psu.edu/bartal92new.html More
@inproceedings{ bartal92new,
author = "Yair Bartal and Amos Fiat and Howard Karloff and Rakesh Vohra",
title = "New algorithms for an ancient scheduling problem",
pages = "51--58",
year = "1992",
url = "citeseer.ist.psu.edu/bartal92new.html" }
Citations (may not include all citations):212 Optimization and Approximation in Deterministic Sequencing a.. (context) - Graham, Lawler et al. - 1979
204 Sequencing and Scheduling: Algorithms and Complexity (context) - Lawler, Lenstra et al.
170 Bounds for Certain Multiprocessing Anomalies (context) - Graham - 1966
30 Line Scheduling Heuristic with Better Worst Case Ratio than .. (context) - Galambos, Woeginger et al.
20 the Performance of On-Line Algorithms for Partition Problems (context) - Faigle, Kern et al. - 1989
15 personal communication (context) - Linial
4 An Introduction to Multiprocessor Scheduling (context) - Lenstra, Kan - 1988
1 Optimal On-Line Algorithms for Scheduling (context) - Narayanan, Chandrasekaran - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.icsi.berkeley.edu/~yairb/): More
Dump: Competitive Distributed Paging - Awerbuch, Bartal, Fiat (1993) (Correct)
Competitive Distributed File Allocation - Awerbuch, Bartal, Fiat (1993) (Correct)
A Better Lower Bound for On-Line Scheduling - Bartal, Karloff, Rabani (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC