Optimal buffer allocation in asynchronous cyclic mixed-model assembly lines

This paper considers a problem of optimal buffer allocation in cyclic asynchronous mixed-model 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.