This paper considers a problem of optimal buffer allocation in cyclic asynchronous mixedmodel assembly lines with deterministic processing times. An analytical model is used to provide new insights into properties of optimal buffer allocation, that is, a buffer configuration that guarantees the highest possible throughput rate on the assembly line with a minimum number of buffers. Optimal buffer configuration is characterized, and an efficient algorithm to find such a configuration is developed. The approach proposed in this paper also provides insights on how to allocate a given number of buffers to workstations on the assembly line to maximize the throughput rate.
ConwayR.MaxwellW.McClainJ. O., and ThomasL. J. (1988), “The Role of Work‐in‐Process Inventory on Serial Production Lines,Operations Research, 36, 2, 229–241.
2.
FuxmanL. (1994), Mixed‐Model Assembly Lines Under Cyclic Production: Models for Productivity Improvement and Teamwork, Ph.D. dissertation, Wharton School, University of Pennsylvania, Philadelphia, PA.
3.
GoldbergA. V. and TarjanR. E. (1988), “A New Approach to the Maximum‐Flow Problem,Journal of the Association for Computing Machinery, 35, 4, 921–940.
4.
HillierF. S. and BolingR. W. (1966), “The Effect of Some Design Factors on the Efficiency of Production Lines with Variable Operation Times,Journal of Industrial Engineering, 17, 12, 651–658.
5.
HillierF. S.SOK. C., and BolingR. W. (1993), “Notes: Towards Characterizing the Optimal Allocation of Storage Space in Production Line Systems with Variable Processing Times,Management Science, 39, 1, 126–133.
6.
JordanW. C. and GravesS. C. (1995), “Benefits of Manufacturing Process Flexibility,Management Science, 41, 4, 577–607.
7.
KarabatiS. and KouvelisP. (1994), “The Interface of Buffer Design and Cyclic Scheduling Decisions in Deterministic Flow Lines,Annals of Operations Research, 50, 295–317.
8.
KarabatiS. and KouvelisP. (1996), “Cyclic Scheduling in Flow Lines: Modeling Observations, Effective Heuristics and Optimal Cycle Time Minimization Procedure,Naval Research Logistics, 43, 2, 211–231.
9.
KarabatiS.KouvelisP.KiranA. S. (1992), “Games, Critical Paths and Assignment Problems in Permutation Flowshops and Cyclic Scheduling Flowline Environments,Journal of Operational Research Society, 43, 3, 241–258.
10.
LevnerE. M. (1969), “Optimal Planning of Parts Machining on a Number of Machines,Automatic Remote Control, 12, 1972–1978.
11.
McCormickS. T.PinedoM. L.ShenkerS., and WolfB. (1989), “Sequencing in An Assembly Line with Blocking to Minimize Cycle Time,Operations Research, 37, 6, 925–935.
12.
McCormickS. T.PinedoM. L.ShenkerS., and WolfB. (1991), “Transient Behavior in a Flexible Assembly System,Journal of Flexible Manufacturing Systems, 3, 27–44.
13.
RaoN. P. (1975), “Two Stage Production Systems with Intermediate Storage,AIIE Transactions, 7, 4, 414–421.
14.
SarkerB. R. (1984), “Some Comparative and Design Aspects of Series Production Systems,IIE Transactions, 16, 229–239.
15.
WittrockR. J. (1985), “Scheduling Algorithms for Flexible Flow Lines,IBM Journal of Research and Development, 29, 4, 401–412.
