Heuristic Programming Applied to Scheduling Models,

Abstract

Heuristic programming as used in the paper refers to a search technique having general applicability to combinatorial optimization problems. After describing the elements of a heuristic program, the author shows its application to two scheduling problems; namely, scheduling independent tasks on parallel processors, and the flow-shop problem. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1971
Accession Number
AD0732131

Entities

People

  • M. J. Krone

Organizations

  • Princeton University

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Computers
  • Cooperation
  • Optimization
  • Parallel Processors
  • Scheduling (Production)

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Parallel and Distributed Computing.