Scheduling uniform machines on-line requires nondecreasing speed ratios

Mathematical Programming, Series B

Volumn 82, Issue 1-2, 1998, Pages 225-234

  Vestjens, Arjen P A ^a,b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CQM   (Netherlands)

Author keywords

On line algorithms; Preemptive scheduling; Uniform machines

Indexed keywords

EID: 0004214579     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01585873     Document Type: Article

References (8)

1. Y. Bartal, A. Fiat, H. Karloff, R. Vohra, New algorithms for an ancient scheduling problem, Journal of Computer and System Sciences 51 (1995) 359-366.
2. B. Chen, A. van Vliet, G.J. Woeginger, An optimal algorithm for preemptive on-line scheduling, Operations Research Letters 18 (1995) 127-131.
3. K.S. Hong, J.Y.-T. Leung, On-line scheduling of real-time tasks, IEEE Transactions on Computers 41 (1992) 1326-1331.
4. J. Labetoulle, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W.R. Pulleyblank (Ed.), Progress in Combinatorial Optimization, Academic Press, Toronto, 1984, pp. 245-261, ISBN 0-12-566780-9.
5. T. Gonzalez, S. Sahni, Preemptive scheduling of uniform processor systems, Journal of the ACM 25 (1978) 92-101.
6. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Logistics of Production and Inventory, Handbooks in OR and MS 4, Elsevier, Amsterdam, Ch. 9, 1993, pp. 445-522, ISBN 0-444-87472-0.
7. E.C. Horvath, S. Lam, R. Sethi, A level algorithm for preemptive scheduling, Journal of the ACM 24 (1977) 32-43.
8. S. Sahni, Y. Cho, Nearly on-line scheduling of a uniform processor system with release times, SIAM Journal on Computing 8 (1979) 275-285.