THREE-MACHINE FLOWSHOP STOCHASTIC SCHEDULING TO MINIMIZE DISTRIBUTION OF SCHEDULE LENGTH.

E. Frostig, I. Adiri

Research output: Contribution to journalConference articlepeer-review

Abstract

This article studies a special case of stochastic three-machine, permutation flowshop scheduling. It is proved that a sequence where processing times on the first and third machines are in a monotone nondecreasing and nonincreasing order of the likelihood ratio, respectively, and on the second machine are equally distributed, minimizes distribution of schedule length.

Original languageEnglish
Pages (from-to)179-183
Number of pages5
JournalNaval Research Logistics Quarterly
Volume32
Issue number1
DOIs
StatePublished - 1 Feb 1985
Externally publishedYes
EventProc of the Workshop on Qual Control, New Dev and Pract for Sampling Insp - Washington, DC, USA
Duration: 7 Mar 19838 Mar 1983

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'THREE-MACHINE FLOWSHOP STOCHASTIC SCHEDULING TO MINIMIZE DISTRIBUTION OF SCHEDULE LENGTH.'. Together they form a unique fingerprint.

Cite this