The Two-Machine Flow-Shop with Random Processing Times,

Abstract

The authors consider the problem of sequencing n jobs in a simple two-machine flow-shop with the objective of finding a schedule with stochastically smallest makespan. Results are derived under a special stochastic structure for the processing time distributions. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 11, 1972
Accession Number
AD0750409

Entities

People

  • Hamilton Emmons
  • Mark O. Brown

Organizations

  • George Washington University

Tags

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Graph Algorithms and Convex Optimization.
  • Operations Research