David Karger, Cliff Stein, Joel Wein  Home/Search
Context Related
| dartmouth.edu/~cli...edulingSurvey.ps.Z 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: dartmouth.edu/~cliff/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction Scheduling theory is concerned with the optimal allocation of scarce resources to activities over time. The practice of this field dates to the first time two humans contended for a shared resource and developed a plan to share it without bloodshed. The theory of the design of algorithms for scheduling is younger, but still has a significant history -- the earliest papers in the field were published more than forty years ago. Researchers have studied literally thousands of... (Update)
Context of citations to this paper: More
.... complete (see, e.g. 4] After the NP completeness results, the focus shifted to the design of approximation algorithms (see, e.g. [6, 8]) Many natural heuristics for scheduling are in fact online strategies. Hence, when the study of online strategies using competitive...
...time is reduced. The opposite algorithm, Largest Processing Time First (LPT) executes the jobs with the longest processing time rst [15, 16]. This policy aims at minimizing the makespan, but the average response time is increased because many small jobs are delayed signi...
Cited by: More
Traffic Aided Opportunistic Scheduling for Downlink.. - Hu, Zhang, Sadowsky (2004) (Correct)
Backfilling with Lookahead to Optimize the Packing - Of Parallel Jobs (Correct)
Algorithms for Flow Time Scheduling - Bansal (2003) (Correct)
Similar documents (at the sentence level):
78.5%: Scheduling Algorithms - Karger, Stein, Wein (1997) (Correct)
Active bibliography (related documents): More All
0.6: Syllabus(Tentative) - Ta Ti Ve (Correct)
0.3: Improved Scheduling Algorithms for Minsum Criteria .. - Chakrabarti.. (1996) (Correct)
0.2: Task Scheduling in Networks - Phillips, Stein, Wein (1996) (Correct)
Similar documents based on text: More All
0.2: Preemptive Scheduling Of Uniform Processors With Memory - Lai, Sahni (1981) (Correct)
0.2: Distributed Job Scheduling in Rings Perry Fizzano - Fizzano, Karger, Stein, Wein (Correct)
0.2: Improved Bounds on Relaxations of a Parallel.. - Phillips, Schulz, .. (1998) (Correct)
Related documents from co-citation: More All
8: Flow and stretch metrics for scheduling continuous job streams - Bender, Chakrabarti et al. - 1998
7: Scheduling to minimize average completion time: offline and on-line algorithms - Hall, Schulz et al. - 1996
7: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
BibTeX entry: (Update)
D. Karger, C. Stein, and J. Wein. Scheduling algorithms. In CRC Handbook of Computer Science. 1997. http://citeseer.ist.psu.edu/karger97scheduling.html More
@incollection{ karger97scheduling,
author = "D. Karger and C. Stein and Joel Wein",
title = "Scheduling algorithms",
booktitle = "Handbook of Algorithms and Theory of Computation",
publisher = "CRC Press",
editor = "M. J. Atallah",
year = "1997",
url = "citeseer.ist.psu.edu/karger97scheduling.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
370 Network Flows : Theory (context) - Ahuja, Magnanti et al. - 1993
212 Optimization and approximation in deterministic sequencing a.. (context) - Graham, Lawler et al. - 1979
206 Rinehart and Winston (context) - Lawler, Networks et al. - 1976
204 Sequencing and scheduling: Algorithms and complexity (context) - Lawler, Lenstra et al. - 1993
171 Scheduling to minimize average completion time: Off-line and.. - Hall, Schulz et al. - 1997
152 Introduction to Sequencing and Scheduling (context) - Baker - 1974
135 Theory of Scheduling (context) - Conway, Maxwell et al. - 1967
129 A polynomial algorithm in linear programming (context) - Khachiyan - 1979
112 NP-complete scheduling problems (context) - Ullman - 1975
104 Various optimizers for single-stage production (context) - Smith - 1956
92 Using dual approximation algorithms for scheduling problems:.. (context) - Hochbaum, Shmoys - 1987
87 Approximation algorithms for scheduling unrelated parallel m.. (context) - Lenstra, Shmoys et al. - 1990
83 Bounds for certain multiprocessor anomalies (context) - Graham - 1966
62 Open shop scheduling to minimize finish time (context) - Gonzalez, Sahni - 1976
56 Optimal two- and three-stage production schedules with setup.. (context) - Johnson - 1954
53 Scheduling with deadlines and loss functions (context) - McNaughton - 1959
44 Scheduling a production line to minimize maximum tardiness (context) - Jackson - 1955
43 Algorithms and Systems (context) - Pinedo, Theory - 1995
43 Scheduling independent tasks to reduce mean finishing time (context) - Bruno, Coffman et al. - 1974
32 Optimal sequencing of a single machine subject to precedence.. (context) - Lawler - 1973
31 Minimizing average completion time in the presence of releas.. - Phillips, Stein et al. - 1995
28 A functional equation and its application to resource alloca.. (context) - Lawler, Moore - 1969
25 one machine sequencing algorithm for minimizing the number o.. (context) - Moore - 1968
23 Structure of a simple scheduling polyhedron (context) - Queyranne - 1993
23 line scheduling -- a survey - Sgall - 1997
22 A supermodular relaxation for scheduling with release dates - Goemans - 1996
21 Naval Research Logistics Quarterly (context) - Horn, scheduling - 1974
16 Bounds on multiprocessing anomalies (context) - Graham - 1969
14 Minimizing average flow time with parallel machines (context) - Horn - 1973
10 Approximation Algorithms for NP-hard problems (context) - Hall - 1997
10 Approximation schemes for constrained scheduling problems (context) - Hall, Shmoys - 1989
8 Sequencing and scheduling (context) - Hoogeveen, Lenstra et al. - 1997
5 Tobbg'epes utemez'esi probl'em'ak kozel optim'alis megold'as.. (context) - B'ar'any, Fiala - 1982
4 Approximation Algorithms (context) - Hochbaum - 1997
3 On preeemptive scheduling of of unrelated parallel processor.. (context) - Lawler, Labetoulle - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.dartmouth.edu/~cliff/papers/): More
Distributed Job Scheduling in Rings Perry Fizzano - Fizzano, Karger, Stein, Wein (Correct)
Improved Scheduling Algorithms for Minsum Criteria .. - Chakrabarti.. (1996) (Correct)
Long Tours and Short Superstrings (extended abstract) - Kosaraju, Park, Stein (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