Preemptive Scheduling with Due Dates

Sartaj Sahni
Additional contact information
Sartaj Sahni: University of Minnesota, Minneapolis, Minnesota

Operations Research, 1979, vol. 27, issue 5, 925-934

Abstract: An 0( n log mn ) algorithm is presented to preemptively schedule n tasks on m identical machines. The tasks are assumed to have due dates. All tasks are initially available. The objective is to obtain a preemptive schedule that meets all due dates (when possible). Our algorithm generates schedules with at most n − 2 preemptions. The algorithm may also be used to schedule a set of n tasks all having the same due date but having different release dates.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.5.925 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:5:p:925-934

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().