Parallel Scheduling Algorithms.

Abstract

We obtain fast parallel algorithms for several scheduling problems. Some of the problems considered are: 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. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1981
Accession Number
ADA103796

Entities

People

  • Eliezer Dekel
  • Sartaj Sahni

Organizations

  • University of Minnesota

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computational Processes
  • Computations
  • Computer Science
  • Computers
  • Computing-Related Activities
  • Data Sets
  • Electrical Circuits
  • Instructions
  • Intervals
  • Lists (Data Structures)
  • Mathematics
  • Minnesota
  • Parallel Computing
  • Scheduling (Production)
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Parallel and Distributed Computing.