Semi on-line algorithms for the partition problem
Authors:
- Hans KellererHKHans Kellerer
- Vladimir KotovVKVladimir Kotov
- Maria Grazia SperanzaMSMaria Grazia Speranza
- Zsolt TuzaZTZsolt Tuza
- 1 January 1997
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 21 (5) , 235-242
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Randomized algorithms for that ancient scheduling problem1997
- A Better Algorithm for an Ancient Scheduling ProblemJournal of Algorithms, 1996
- Ordinal algorithms for parallel machine schedulingOperations Research Letters, 1996
- New Algorithms for an Ancient Scheduling ProblemJournal of Computer and System Sciences, 1995
- A look-ahead heuristic for scheduling jobs with release dates on a single machineComputers & Operations Research, 1994
- A better lower bound for on-line schedulingInformation Processing Letters, 1994
- On-line scheduling of parallel jobs1994
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List SchedulingSIAM Journal on Computing, 1993
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966