Parallel scheduling algorithms
Journal Article
·
· Oper. Res.; (United States)
Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms. 26 references.
- Research Organization:
- Univ. of Minnesota, Minneapolis
- OSTI ID:
- 5363069
- Journal Information:
- Oper. Res.; (United States), Journal Name: Oper. Res.; (United States) Vol. 1; ISSN OPREA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel job-scheduling algorithms
A parallel algorithm for preemptive scheduling of uniform machines
A parallel matching algorithm for convex bipartite graphs and applications to scheduling
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5457809
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
A parallel matching algorithm for convex bipartite graphs and applications to scheduling
Journal Article
·
Wed Oct 31 23:00:00 EST 1984
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6593491