Lead Time Distribution of Three-Machine Two-Buffer Lines with Unreliable Machines and Finite Buffers
Lead Time Distribution of Three-Machine Two-Buffer Lines with Unreliable Machines and Finite Buffers
复制标题
机器不可靠和缓冲区有限的三机两缓冲区生产线的交货时间分布
DOI:
--
复制
发表时间:
2016
期刊:
影响因子:
--
通讯作者:
S. Gershwin
中科院分区:
文献类型:
--
作者:
Chuan Shi;S. Gershwin
The lead time of a manufacturing system is the amount of time a part spends in it. This quantity is important because customers demand short and reliable lead times, and because many products lose value in storage. It is random because of some of the events that occur during the production process, including unpredictable machine failures, uncertain processing times, and quality variations. Knowledge of the probability distribution of lead time can be useful in deciding how to design or operate a system, and in making delivery date commitments. We describe an analytic method for determining the steady-state probability distribution of the lead time of a three-machine, two-buffer production line in which the buffers are finite. The method is an extension of recent work by the authors on the probability distribution of the sojourn time of a two-machine line. We consider the movement of a reference part from its arrival until its departure. We first compute the conditional probability that the lead time T = τ , given the state of the line when the part arrives. This is done by solving a set of recurrence equations which are developed from a detailed analysis of the reference part’s movement through the first buffer, from the first to the second buffer, and through the second buffer. The conditioning is removed by using the steady-state probability distribution of the three-machine line. We provide two kinds of numerical evidence for the accuracy of this method. First, we show that it satisfies Little’s Law. Then we compare the distribution calculated by the new method with the simulated lead time distribution for several cases and show very close agreement. Several numerical examples then are examined to observe the shapes of the probability distributions and how they are influenced by the parameters of the machines and the sizes of the buffers. Other numerical experiments demonstrate the effect of the existence and location of a bottleneck. Finally, we suggest future research directions.