Create citation alert.
Buy this article in print. Journal RSS feed.
Joseph Leung - Citações do Google Acadêmico
Sign up for new issue notifications. Parallel applications that present tasks with imbalanced loads or complex communication behavior usually do not exploit the underlying resources of parallel platforms to their full potential. In order to mitigate this issue, global scheduling algorithms are employed. As finding the optimal task distribution is an NP-Hard problem, identifying the most suitable algorithm for a specific scenario and comparing algorithms are not trivial tasks.
- Scheduling overloaded real-time systems with comparative/worst case guarantees — NYU Scholars.
- Scheduling overloaded real-time systems with comparative/worst case guarantees.
- Collision and Collapse at the Africa-arabia-eurasia Subduction Zone (Geological Society Special Publication).
- 1st Edition.
Scheduling problems in the airline industry
Create lists, bibliographies and reviews: or. Search WorldCat Find items in libraries near you. Advanced Search Find a Library.
Refine Your Search Year. Your list has reached the maximum number of items. Please create a new list with a new name; move some items to a new or existing list; or delete some items. Handbook of scheduling : algorithms, models, and performance analysis.
source url Skip to main content. Libraries School of Law.
Title Constraint Programming for Scheduling. Author s John J.
Abstract Our goal is to introduce the constraint programming CP approach within the context of scheduling. We conclude with our speculations about the future of scheduling research using this approach. Digital Commons.