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

Journal of Scheduling

Volumn 3, Issue 6, 2000, Pages 333-341

  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

EID: 0041623258     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1425(200011/12)3:6<333::aid-jos53>3.0.co;2-8     Document Type: Article

References (15)

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