A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 1, 2000, Pages 56-63

  Hoogeveen, J A ^a   Vestjens, A P A ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b Center for Quantative Methods CQM   (Netherlands)

Author keywords

On line algorithm; Single machine scheduling; Worst case analysis

Indexed keywords

EID: 0003054009     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480196296823     Document Type: Article

References (12)

1. B. CHEN, A. VAN VLIET, AND G. J. WOEGINGER (1994), New lower and upper bounds for on-line scheduling, Oper. Res. Lett., 16, pp. 221-230.
2. R. L. GRAHAM (1966), Bounds for certain multiprocessing anomalies, Bell System Tech. J., 45, pp. 1563-1581.
3. L. A. HALL, A. S. SCHULZ, D. B. SHMOYS, AND J. WEIN (1997), Scheduling to minimize average completion time: Off-line and on-line approximation algorithms, Math. Oper. Res., 22, pp. 513-544.
4. H. KISE, T IBERAKI, AND H MINE (1979), Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem wih ready times, J. Oper. Res. Soc. Japan. 22, pp 205-224
5. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS (1993), Sequencing and scheduling: Algorithms and complexity, in Logistics of Production and Inventory; Handbooks Oper. Res. Management Sci. 4, S. C. Graves, P. H. Zipkin, and A. H. G. Rinnooy Kan, eds., North-Holland, Amsterdam, pp. 445-522.
6. R. MOTWANI, S. PHILLIPS, AND E. TORNG (1994), Non-clairvoyant scheduling, Theoret. Comput. Sci., 130, pp. 17-47.
7. C. PHILLIPS, C. STEIN, AND J. WEIN (1998), Minimizing average completion time in the presence of release dates, Math. Programming (B). 28, pp. 199-223.
8. C N. POTTS (1980), Analysis of a heuristic for one machine sequencing with release dates and delivery times, Oper. Res. 28, pp. 1436-1441.
9. S. S. SEIDEN (1998), Randomized Online Scheduling with Delivery Times, Report Woe-24, Technical University Graz, Graz, Austria.
10. J. SGALL (1998), On-line scheduling, in A. Fiat and G. J. Woeginger, eds., On-Line Algorithms: The State of the Art, Lecture Notes in Comput. Sci. 14421, Springer, Berlin.
11. D. B. SHMOYS, J. WEIN, AND D. P. WILLIAMSON (1995), Scheduling parallel machines on-line, SIAM J. Comput. 24, pp. 1313-1331
12. A. P. A. VESTJENS (1997), On-line Machine Scheduling, Ph.D. thesis, Eindhoven University of Technology, Eindhoven, The Netherlands.