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.
No takes yet. Share an insight, caveat, or question.
Dekel et al. (1983) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: