Efficient Throughput Analysis of Production Lines Based on Modular Queues

Analyzing throughput is very important for the design, optimization, and management of production lines. In this paper, we present an efficient throughput analysis approach for production lines with merging, splitting, and recirculating topologies. In particular, we define a decomposition regulation based on queue modules for the decomposition of the various topologies, and we improve an iterative approximation method for calculating and iterating the queue module state probabilities until the throughput of the production line is obtained. To decrease the computation time and automate the calculation process of the queue module state probabilities, we build a queue module database that includes the solution equations of common queue module state probabilities. The numerical examples show that our approach calculates the throughput of production lines with merging, splitting, and recirculating topologies with high accuracy (≥90%) and efficiency (completed in ten min). Our contribution is an efficient throughput evaluation methodology that can be used to rapidly estimate the performance and the cost of production lines with various topologies in the conceptual design phase of production lines in the industry.

[1]  B. Filipowicz,et al.  Queueing systems and networks. Models and applications , 2008 .

[2]  Dug Hee Moon,et al.  Approximation of throughput in tandem queues with multiple servers and blocking , 2014 .

[3]  Linda C. Schmidt,et al.  Modeling recirculating conveyors with blocking , 2000, Eur. J. Oper. Res..

[4]  Shaochen Wang Discrete event simulation analysis on multiple class single server queueing system with abandonments and promotions , 2019 .

[5]  Ali Azadeh,et al.  Optimization of production systems through integration of computer simulation, design of experiment, and Tabu search: the case of a large steelmaking workshop , 2010 .

[6]  Dennis E. Blumenfeld,et al.  An analytical formula for throughput of a production line with identical stations and random failures. , 2005 .

[7]  Alan G. Konheim,et al.  Finite Capacity Queuing Systems with Applications in Computer Modeling , 1978, SIAM J. Comput..

[8]  Miron Vinarskiy A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes , 2017, Eur. J. Oper. Res..

[9]  Alexandre Brandwajn,et al.  An Approximation Method for Tandem Queues with Blocking , 1988, Oper. Res..

[10]  Alexandre Brandwajn,et al.  Equivalence and Decomposition in Queueing Systems - A Unified Approach , 1985, Perform. Evaluation.

[11]  Tom Van Woensel,et al.  Finite Queueing Modeling and Optimization: A Selected Review , 2014, J. Appl. Math..

[12]  Miron Zapciu,et al.  Production Systems Flow Modelling Using Decomposition Method and Required Buffers , 2017 .

[13]  Jean-Sébastien Tancrez,et al.  A decomposition method for assembly/disassembly systems with blocking and general distributions , 2020, Flexible Services and Manufacturing Journal.

[14]  Alexandre Brandwajn,et al.  A Note on Approximate Iterative Solution of Open Tandem Networks with Blocking , 1989, Perform. Evaluation.

[15]  Gordon F. Newell,et al.  Cyclic Queuing Systems with Restricted Length Queues , 1967, Oper. Res..

[16]  Reinaldo Morabito,et al.  Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks , 2014, Eur. J. Oper. Res..

[17]  Jong-Hwan Kim,et al.  Approximate analysis of finite fork/join queueing networks , 1997 .

[18]  Ricardo H. C. Takahashi,et al.  Pareto Optimal Solutions for Stochastic Dynamic Programming Problems via Monte Carlo Simulation , 2013, J. Appl. Math..

[19]  Yves Dallery,et al.  Manufacturing flow line systems: a review of models and analytical results , 1992, Queueing Syst. Theory Appl..

[20]  James MacGregor Smith,et al.  Generalized M/G/C/C state dependent queueing models and pedestrian traffic flows , 1994, Queueing Syst. Theory Appl..

[21]  J. George Shanthikumar,et al.  An Approximate Model of Multistage Automatic Transfer Lines with Possible Scrapping Of Workpieces , 1987 .

[22]  Jingshan Li,et al.  Evaluation of throughput in serial production lines with non-exponential machines , 2005 .

[23]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[24]  Henri Pierreval,et al.  Dynamic facility layout problem based on open queuing network theory , 2017, Eur. J. Oper. Res..

[25]  Michal Dorda,et al.  Modelling of Freight Trains Classification Using Queueing System Subject to Breakdowns , 2013 .

[26]  James R. Morrison,et al.  Decomposition without aggregation for performance approximation in queueing network models of semiconductor manufacturing , 2019 .

[27]  M.B.M. deKoster Estimation of Line Efficiency by Aggregation , 1987 .

[28]  William J. Stewart,et al.  Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modeling , 2009 .

[29]  J. MacGregor Smith,et al.  State-dependent models of material handling systems in closed queueing networks , 2012 .

[30]  Simonetta Balsamo Queueing Networks with Blocking: Analysis, Solution Algorithms and Properties , 2011, Network Performance Engineering.

[31]  Waldemar Małopolski,et al.  An Approach to Modeling and Simulation of a Complex Conveyor System Using Delmia Quest—A Case Study , 2018 .