Minimizing cycle time in a blocking flowshop
成果类型：
Article
署名作者：
Abadi, INK; Hall, NG; Sriskandarajah, C
署名单位：
University System of Ohio; Ohio State University; University of Texas System; University of Texas Dallas
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.48.1.177.12451
发表日期：
2000
页码：
177-180
关键词：
摘要：
We consider a blocking (i.e., bufferless) flowshop that repetitively processes a minimal part set to minimize its cycle time, or equivalently to maximize its throughput rate. The best previous heuristic procedure solves instances with 9 machines and 25 jobs, with relative errors averaging about 3% but sometimes as much as 10%. The idea of deliberately slowing down the processing of operations (i.e., increasing their processing times) establishes a precise mathematical connection between this problem and a no-wait flowshop. This enables a very effective heuristic for the no-wait flowshop to be adapted as a heuristic for the blocking flowshop. Our computational results show relative errors that average less than 2% for instances with 20 machines and 250 jobs.