Parallel Scheduling Algorithms

1 February 1983

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 31 (1) , 24-49
https://doi.org/10.1287/opre.31.1.24

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

ALGORITHMS PARALLEL
SCHEDULING ALGORITHMS
SCHEDULING PROBLEMS
TARDY JOBS
TARDINESS PENALTIES
MINIMIZE EARLINESS
PARALLEL COMPUTERS

This publication has 0 references indexed in Scilit: