Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- 1 November 2000
- journal article
- research article
- Published by Wiley in Journal of Scheduling
- Vol. 3 (6) , 333-341
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single MachineSIAM Journal on Discrete Mathematics, 2000
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation AlgorithmsMathematics of Operations Research, 1997
- Scheduling Parallel Machines On-LineSIAM Journal on Computing, 1995
- New lower and upper bounds for on-line schedulingOperations Research Letters, 1994
- Nonclairvoyant schedulingTheoretical Computer Science, 1994
- Chapter 9 Sequencing and scheduling: Algorithms and complexity1993
- Algorithms for Scheduling Tasks on Unrelated ProcessorsJournal of the ACM, 1981
- PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMESJournal of the Operations Research Society of Japan, 1979
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966