A probabilistic analysis of two-machine flowshops
成果类型：
Article
署名作者：
Ramudhin, A; Bartholdi, JJ; Calvin, JM; Vate, JHV; Weiss, G
署名单位：
Laval University; University System of Georgia; Georgia Institute of Technology
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.44.6.899
发表日期：
1996
页码：
899-908
关键词：
摘要：
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.