Abstract
In general, the task scheduling problem is classified as NP-complete (Aho et al., 1974). Polynomial solutions are not available in most cases due to the large interacting degrees of freedom. Several methods based on graph theoretic, enumerated search, mathematical programming, and queuing theory have been proposed as possible solutions to the problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Salleh, S., Zomaya, A.Y. (1999). Task Scheduling. In: Scheduling in Parallel Computing Systems. The Springer International Series in Engineering and Computer Science, vol 510. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5065-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5065-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7303-2
Online ISBN: 978-1-4615-5065-5
eBook Packages: Springer Book Archive