Optimal utilization of a finite capacity integrated assembly system

An optimal concurrent design and loading strategy for a flexible assembly line system: to control the bottleneck

“…The asymptotic (e.g. long-term analysis, the appropriate performance measures are often expressed independent of the time measure) techniques for queueing networks with finite and infinite capacity queueing nodes: (a) Using the product-form algorithms [7] (b) Using the decomposition algorithms [8,9] (c) Using the isolation algorithms [2,3,10] (d) Using the semi-Markov based algorithms [11][12][13] (e) Using the diffusion and the Brownian motion based algorithms [6] In this paper, the decomposition approach will be applied for analysis of the assembly line system. For a review of the literature and the departure processes, see [14] and also [15].…”

“…selecting sufficiently small loading rate) such that the resulting probability of finding each node blocked will be sufficiently close to zero. For a review of this perspective, see Pourbabai [2,3]. In [2], the bottleneck control problem has been addressed in a simple Markovian enviroament (e.g.…”

“…the interarrival times and the processing times are exponentially distributed random variables), and the minimum required local storage size for a compatible assembly line system is obtained. In [3], the bottleneck control problem has also been addressed in a simple Markovian environment, and the value of the maximum throughput rate from the system is obtained. In this paper, the bottleneck control problem has been restated in a non-Markovian environment, and the proposed solution algorithm is an extension and a generalisation of that given by [2][3][4].…”

“…In [3], the bottleneck control problem has also been addressed in a simple Markovian environment, and the value of the maximum throughput rate from the system is obtained. In this paper, the bottleneck control problem has been restated in a non-Markovian environment, and the proposed solution algorithm is an extension and a generalisation of that given by [2][3][4]. In this paper, the assumption in [2,3] regarding the loading process, which was assumed to be Poisson, is relaxed, and the distribution of the interarrival time is assumed to be generally distributed.…”

“…In this paper, the bottleneck control problem has been restated in a non-Markovian environment, and the proposed solution algorithm is an extension and a generalisation of that given by [2][3][4]. In this paper, the assumption in [2,3] regarding the loading process, which was assumed to be Poisson, is relaxed, and the distribution of the interarrival time is assumed to be generally distributed. Thus, in this paper, the variability of the interarrival times of the loading process at the loading station and each one of the workstations and the transporter stations can be any value greater than zero.…”