Scheduling Rules for Parallel Processors.

Abstract

This paper investigates various criteria under which simple scheduling rules generate optimum schedules for m machine scheduling problems. The problems are considered under a job-splitting assumption. Some of the rules which generate optimum schedules with job splitting for the multi-machine problems, do not split jobs for the single machine problems. The relationship between the job splitting and no job splitting problem in these cases, is analogous to the situation when an optimum solution to a linear program has all the variables integer and hence is optimum to the corresponding integer program. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1976
Accession Number
ADA028491

Entities

People

  • H. Donald Ratliff
  • Louis A. Martin-vega

Organizations

  • University of Florida

Tags

DTIC Thesaurus Topics

  • Linear Programming
  • Parallel Processors
  • Scheduling (Production)
  • Splitting

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Parallel and Distributed Computing.