A Probabilistic Analysis of Two-Machine Flowshops

Amar Ramudhin, John J. Bartholdi, James M. Calvin, John H. Vande Vate and Gideon Weiss
Additional contact information
Amar Ramudhin: Université Laval, Quebec, Canada
John J. Bartholdi: Georgia Institute of Technology, Atlanta, Georgia
James M. Calvin: Georgia Institute of Technology, Atlanta, Georgia
John H. Vande Vate: Georgia Institute of Technology, Atlanta, Georgia
Gideon Weiss: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1996, vol. 44, issue 6, 899-908

Abstract: We study a two-machine flowshop in which all processing times are independently and identically distributed, with values known to the scheduler. We are able to describe in detail the expected behavior of the flowshop under optimal and heuristic schedules. Our results suggest that minimizing makespan might be a superfluous objective: random schedules are easier to construct and require significantly less intermediate storage between the machines; moreover, they are known to be asymptotically optimal.

Keywords: sequencing; stochastic scheduling; approximations; heuristics for two-machine flowshop (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.44.6.899 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:44:y:1996:i:6:p:899-908

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().