Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1879, Issue , 2000, Pages 427-436

  van den Akker, Marjan ^a   Hoogeveen, Han ^b   Vakhania, Nodari ^c  

^a NATIONAL AEROSPACE LABORATORY NLR   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c UNIVERSIDAD AUTÓNOMA DEL ESTADO DE MORELOS   (Mexico)

Author keywords

On line algorithm; Restart; Single machine scheduling; Worst case analysis

Indexed keywords

SCHEDULING; ALGORITHMS;

EXTENDED ABSTRACTS; ON-LINE ALGORITHMS; ONLINE SCHEDULING; PERFORMANCE BOUNDS; RESTART; SINGLE-MACHINE SCHEDULING; WORST-CASE ANALYSIS; WORST-CASE PERFORMANCE; SINGLE- MACHINES;

SCHEDULING ALGORITHMS;

EID: 84927165985     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_39     Document Type: Article

References (15)

1. B. Chen, A. van Vliet, G.J. Woeginger (1994). New lower and upper bounds for on-line scheduling. Operations Research Letters 16, 221-230.
2. E. Davis and J.M. Jaffe (1981). Algorithms for scheduling tasks on unrelated processors. Journal of the Association of Computing Machinery 28, 721-736.
3. R.L. Graham (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563-1581.
4. L.A. Hall, A.S. Schjjlz, D.B. Shmoys, J. Wein (1997). Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research 22, 513-544.
5. J.A. Hoogeveen, C.N. Potts, and G.J. Woeginger (1999). On-line scheduling on a single machine: Maximizing the number of early jobs. Report Woe-48, Technical University Graz.
6. J.A. Hoogeveen and A.P.A. Vestjens (2000). A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM Journal on Discrete Mathematics 13, 56-63.
7. h. klse, t. ibaraki, H. Mine (1979). Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. Journal of the Operations Research Society Japan 22, 205-224.
8. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (1993). Sequencing and scheduling: algorithms and complexity. S.C. Graves, P.H. Zipkin, A.H.G. Rinnooy Kan (eds.). Logistics of Production and Inventory; Handbooks in Operations Research and Management Science, Vol. 4, North-Holland, Amsterdam, 445-522.
9. R. Motwani, S. Phillips, E. Torng (1994). Non-clairvoyant scheduling. Theoretical Computer Science 130, 17-47.
10. C. Phillips, C. Stein, J. Wein (1998). Minimizing average completion time in the presence of release dates. Mathematical Programming (B) 28, 199-223.
11. S.S. Seiden (1998). Randomized Online Scheduling 'with Delivery Times,Report Woe-24, Technical University Graz.
12. J. Sgall (1998). On-line scheduling. A. Fiat, G.J. Woeginger (eds.). On-Line Algorithms: the State of the Art, Lecture Notes in Computer Science 1442, Springer, Berlin, 196-231.
13. D.B. Shmoys, J. Wein, D.P. Williamson (1995). Scheduling parallel machines on-line. SIAM Journal on Computing 24, 1313-1331.
14. A.P.A. Vestjens (1997). On-line machine scheduling, PhD Thesis, Eindhoven University of Technology.
15. G.J. Woeginger (1999). Personal communication.