Preemptive scheduling with release times, deadlines, and due times
Journal Article
·
· J. Assoc. Comput. Mach.; (United States)
Given n jobs, each of which has a release time, a deadline, and a processing requirement, the problem of determining whether there exists a preemptive schedule on m uniform machines which completes each job in the time interval between its release time and its deadline is examined. An o(m/sup 2/n/sup 4/+n/sup 5/) algorithm is presented which uses a generalisation of network flow techniques to construct such a schedule whenever one exists. This algorithm is then used with search techniques to find a schedule which minimises maximum lateness. 10 references.
- Research Organization:
- Univ. of California, Davis
- OSTI ID:
- 5000893
- Journal Information:
- J. Assoc. Comput. Mach.; (United States), Journal Name: J. Assoc. Comput. Mach.; (United States) Vol. 3; ISSN JACOA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines
Scheduling multiple processors with memory constraints
A parallel algorithm for preemptive scheduling of uniform machines
Journal Article
·
Sun May 01 00:00:00 EDT 1983
· SIAM J. Comput.; (United States)
·
OSTI ID:5342602
Scheduling multiple processors with memory constraints
Conference
·
Thu Dec 31 23:00:00 EST 1981
·
OSTI ID:5106643
A parallel algorithm for preemptive scheduling of uniform machines
Journal Article
·
Wed Nov 30 23:00:00 EST 1988
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:5698743