On the optimality of static policy in stochastic open shop

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)509-512
Number of pages4
JournalOperations Research Letters
Issue number9
StatePublished - Dec 1991


  • open shop
  • stochastic scheduling

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


Dive into the research topics of 'On the optimality of static policy in stochastic open shop'. Together they form a unique fingerprint.

Cite this