On the transient behaviour of a merge production system with an end buffer

Gopalan, M.N.; Kumar, Uday

doi:10.1016/0925-5273(94)90032-9

Cited by 12 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They provided an algorithm to decompose the queuing network into individual queues and they analysed each individual queue in isolation. Gopalan and Kumar (1994) also analysed and evaluated the performance measures of a merge production system with two parallel stations in the first stage and a single station in the second stage. After the second stage there was a buffer with finite capacity.…”

Section: Introductionmentioning

confidence: 99%

Evaluating the performance of a merge supply network with supplier interruptions

Geranios

Vidalis

Vrysagotis

2016

IJDSS

View full text Add to dashboard Cite

In every production and/or inventory control operation, the reliability of the supply process has a great impact on its outcome. We present two analytical models for computing the performance of a merge, push supply network with unreliable suppliers that feed a distribution centre with a common shared buffer. The breakdowns and repair times of the suppliers are modelled via exponential and Coxian-2 distributions. The supply network is modelled as a continuous time Markov process with discrete states. The structure of the transition matrices of these specific systems is explored and two separate computational algorithms are developed to generate them for different values of system characteristics. The proposed algorithms are used as an optimisation tool to determine the optimal values of the system's characteristics such as the number of suppliers, capacity of distribution centre, capacity of buffer and to calculate the system's performance measures. Also a comparison between the two proposed algorithms is provided regarding the performance measures of WIP system , throughput rate, availability and blocking of each supplier.

show abstract

Section: Introductionmentioning

confidence: 99%

Evaluating the performance of a merge supply network with supplier interruptions

Geranios

Vidalis

Vrysagotis

2016

IJDSS

View full text Add to dashboard Cite

show abstract

“…They have decomposed the merge network into separated queues. Gopalan et al [6] studied the transient behavior of a merge production system with two parallel machines in the first stage and one machine in the second one.…”

Section: Introductionmentioning

confidence: 99%

A buffered three-station merge system: Performance analysis and comparative study

Ouazène

Yalaoui

Chehade

et al. 2013

2013 International Conference on Control, Decision and Information Technologies (CoDIT)

View full text Add to dashboard Cite

The addressed paper deals with a merge production system which consists of two parallel machines in the first stage and one machine in the second one. The two stages are separated by a finite buffer and all the machines are unreliable. The processing rates of the machines are not necessary identical. Times of failures and times of repairs are assumed to be exponential. We present an analytical formulation to evaluate the system throughput. This formulation is based on the transformation of the original system to the simple linear model with two machines and one buffer presented by Ouazene et al. ([14], [12]). Two transformation techniques are used and compared. The first technique consists of replacing the parallel machines on the first stage by an equivalent machine. The second one consists of an overlapping decomposition approach which decomposes the original line into two serial lines. We present also a comparative study with existing model in literature based on different numerical experiments. The obtained results show the efficiency of the proposed model.

show abstract

“…The previous research work on approximating the performance of assembly-disassembly queues includes Gershwin [3], Simon and Hopp [10] and Rao and Posner [9]. Some other related analyses for assembly systems are Harrison [6], and Gopalan and Kumar [4,5].…”

Section: Introductionmentioning

confidence: 99%

Untitled

Asadathorn

Chao

1999

Annals of Operations Research

View full text Add to dashboard Cite

The throughputs of assembly and disassembly queueing networks with finite buffer and blocking are difficult to evaluate due to their large state space. In this paper, we present an approximation technique to analyze such a system with Poisson arrivals and exponential service times. It decomposes the system into multiple two-server queues with unlimited input and an assembly or disassembly station with one buffer. The decomposed individual stations are then aggregated and coupled with their input parameters determined by the solution of a set of nonlinear equations which could be effectively calculated through an iterative algorithm. The results are compared with simulations, and the errors are found to be within 10% in all tested cases.

show abstract

On the transient behaviour of a merge production system with an end buffer

Cited by 12 publications

References 10 publications

Evaluating the performance of a merge supply network with supplier interruptions

Evaluating the performance of a merge supply network with supplier interruptions

A buffered three-station merge system: Performance analysis and comparative study

Untitled

Contact Info

Product

Resources

About