A PROBABILISTIC ANALYSIS OF 2-MACHINE FLOWSHOPS

Authors
RAMUDHIN A BARTHOLDI JJ CALVIN JM VATE JHV WEISS G
Citation
A. Ramudhin et al., A PROBABILISTIC ANALYSIS OF 2-MACHINE FLOWSHOPS, Operations research, 44(6), 1996, pp. 899-908
Citations number
7
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
Journal title
Operations research → ACNP
ISSN journal
0030364X
Volume
44
Issue
6
Year of publication
1996
Pages
899 - 908
Database
ISI
SICI code
0030-364X(1996)44:6<899:APAO2F>2.0.ZU;2-0
Abstract
We study a two-machine flowshop in which all processing times are inde pendently and identically distributed, with values known to the schedu ler. We are able to describe in detail the expected behavior of the fl owshop under optimal and heuristic schedules. Our results suggest that minimizing makespan might be a superfluous objective: random schedule s are easier to construct and require significantly less intermediate storage between the machines; moreover, they are known to be asymptoti cally optimal.