Parallel Scheduling Algorithms

Eliezer Dekel and Sartaj Sahni
Additional contact information
Eliezer Dekel: University of Minnesota, Minneapolis, Minnesota
Sartaj Sahni: University of Minnesota, Minneapolis, Minnesota

Operations Research, 1983, vol. 31, issue 1, 24-49

Abstract: 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.

Keywords: 584; parallel; scheduling; algorithms (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.1.24 (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:31:y:1983:i:1:p:24-49

Access Statistics for this article

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