Minimizing variation in stochastic flow shop

  • Authors:
  • Chunfu Jia

  • Affiliations:
  • Department of Computer and System Sciences, Nankai University, Tianjin, 300071, People's Republic of China

  • Venue:
  • Operations Research Letters
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider a two-machine flow shop with blocking, and n jobs with random processing times. The optimal sequences for minimizing the expected variation of waiting times until processing is started on the second machine are established when the jobs can be stochastically ordered.