Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines
Journal Article
·
· SIAM J. Comput.; (United States)
Presents a polynomial time algorithm for constructing an optimal schedule, if a feasible schedule exists, for the following multimachine scheduling problem. There are n unit-time jobs, with arbitrary release times and deadlines, and m identical parallel machines. A feasible schedule is one in which no job is started before it is released, each job is completed by its deadline, and no job is interrupted once it begins to run. 10 references.
- Research Organization:
- IBM Research K51-1bn, San Jose, CA
- OSTI ID:
- 5342602
- Journal Information:
- SIAM J. Comput.; (United States), Journal Name: SIAM J. Comput.; (United States) Vol. 2; ISSN SMJCA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel job-scheduling algorithms
Preemptive scheduling with release times, deadlines, and due times
Polynomial algorithms for multiprocessor scheduling with a small number of job lengths
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5457809
Preemptive scheduling with release times, deadlines, and due times
Journal Article
·
Thu Jul 01 00:00:00 EDT 1982
· J. Assoc. Comput. Mach.; (United States)
·
OSTI ID:5000893
Polynomial algorithms for multiprocessor scheduling with a small number of job lengths
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:471708