On the optimality of static policy in stochastic open shop

  • Authors:

  • Esther Frostig

  • Affiliations:

  • Department of Statistics, University of Haifa, Haifa 31999, Israel

  • Venue:
  • Operations Research Letters
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consider n jobs and two machines. Each job has to be processed on both machines. The order in which it is dome is immaterial. However, the decision maker has to decide in advance which jobs will be processes first on machine 1 (2). We assume that processing times on each machine are identically exponentially distributed random variables. We prove that assigning equal number of jobs to be first processed by machine 1 (2) stochastically minimizes the makespan.