Randomized algorithms for on-line scheduling problems: how low can't you go?
Authors:
- 1 April 2002
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 30 (2) , 89-96
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A guessing game and randomized online algorithms2000
- A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel MachinesMathematics of Operations Research, 2000
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single MachineSIAM Journal on Discrete Mathematics, 2000
- On Randomization in On-Line ComputationInformation and Computation, 1999
- Approximation schemes for minimizing average weighted completion time with release dates1999
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single MachineSIAM Journal on Computing, 1999
- Minimizing average completion time in the presence of release datesMathematical Programming, 1998
- On-line scheduling1998
- Chapter 9 Sequencing and scheduling: Algorithms and complexity1993
- Probabilistic computations: Toward a unified measure of complexity1977