Abstract
Optimal preemptive schedules of jobs with unit completion times and given precedence constraints may require arbitrarily many short intervals of work on a single task.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. G.Coffman and R. L.Graham (1972) Optimal Scheduling for Two Processor Systems, Acta Informatica 1, 200–213.
N. Sauer and M. G. Stone (1989) Preemptive Scheduling, NATO ASI Series Volume 255, I. Rival (ed.), Algorithms and Order, Kluwer, pp. 307–323.
N.Sauer and M. G.Stone (1987) Rational Preemptive Scheduling, Order 4, 195–206.
M. G. Stone (1989) A Scheduling Problem, NATO ASI Series Volume 255, I. Rival (ed.), Algorithms and Order, Kluwer, p. 476.
Author information
Authors and Affiliations
Additional information
Communicated by I. Rival
Rights and permissions
About this article
Cite this article
Pickering, D., Stone, M.G. Task splitting for three machine preemptive scheduling. Order 7, 349–352 (1990). https://doi.org/10.1007/BF00383199
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00383199