Linear-time algorithms for scheduling on parallel processors
Journal Article
·
· Oper. Res.; (United States)
Linear-time algorithms are presented for several problems of scheduling n equal-length tasks on m identical parallel processors subject to precedence constraints. This improves upon previous time bounds for the maximum lateness problem with treelike precedence constraints, the number-of-late-tasks problem without precedence constraints, and the one machine maximum lateness problem with general precedence constraints. 5 references.
- Research Organization:
- Bell Labs., Holmdel, NJ
- OSTI ID:
- 5000438
- Journal Information:
- Oper. Res.; (United States), Vol. 1
- Country of Publication:
- United States
- Language:
- English
Similar Records
Almost-linear algorithm for two-processor scheduling
Scheduling with stochastic gert precedence constraints
Scheduling to minimize average completion time: Off-line and on-line algorithms
Journal Article
·
Thu Jul 01 00:00:00 EDT 1982
· J. Assoc. Comput. Mach.; (United States)
·
OSTI ID:5000438
Scheduling with stochastic gert precedence constraints
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:5000438
Scheduling to minimize average completion time: Off-line and on-line algorithms
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:5000438