An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem.

Abstract

The paper considers a solution to the multiprocessor scheduling problem for the case where the ordering relation between tasks can be represented as a tree. (Modified author abstract)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1973
Accession Number
AD0761177

Entities

People

  • Marc T. Kaufman

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Assembly
  • Assembly Lines
  • Fabrication
  • Manufacturing
  • Multiprocessors
  • Scheduling (Production)

Readers

  • Operations Research
  • Parallel and Distributed Computing.