Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Priority-based scheduling of scarce resources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
McDowell, M.E. ; Space Syst. Div., Los Angeles AFB, CA, USA

In the priority scheduling problem limited resources must be assigned to prioritized jobs of fixed duration. The optimal solution to an instance of the priority scheduling problem assigns resources to as many top priority jobs as possible. The priority scheduling problem is formalized, and it is proved that it is computationally difficult, or NP-hard. An exponential though efficient algorithm which obtains optimal solutions is also proposed. The algorithm is demonstrated on several vexing problems. Finally, modifications to the algorithm which would allow it to obtain 'near optimal' solutions in polynomial time are suggested.<>

Published in:

Aerospace Applications Conference, 1991. Digest., 1991 IEEE

Date of Conference:

3-8 Feb. 1991