Exact analysis of production lines with no intermediate buffers

Article Abstract:

An exact solution to the classic tandem queueing problem was presented. The algorithm is based on the evaluation of the unique positive solution of a quadratic equation using an iterative scheme. The solution also provides the marginal probability distribution of units in each machine, the mean queue length and the critical input rate and thus the corresponding line throughput. Numerical examples for production lines ranging from two to eight stations were also provided.

Methods, Usage, Algorithms, Production control

---

Queueing theory in manufacturing systems analysis and design: a classification of models for production and transfer lines

Article Abstract:

The characterization of production lines and transfer lines by queueing network models is considered. Specifically, the queueing network models in the literature are classified according to their assumptions into exact results, approximate, continuous part flow models. Exact result models may be of the closed-form, state or holding time type, depending on the approach. Likewise, approximate models may be obtained via the phase-type and generalized expansion method.

Models

---

The throughput rate of multistation unreliable production lines

Article Abstract:

A study is conducted to examine unreliable multistations series production lines. The study considers a system where the first station is never starved while the last station is never blocked. A methodology is then considered for developing a linear equation set to describe the production system. Results show that the application of the successive over-relaxation method generates case solutions for the series production system.

Production management

Similar abstracts:

• Abstracts: Patten's problem: talks with China enter a crucial phase. Patten's sidestep
• Abstracts: Streamlined computation for data envelopment analysis. Components of efficiency evaluation in data envelopment analysis
• Abstracts: On the computational complexity of (maximum) shift class scheduling. License class design: complexity and algorithms
• Abstracts: Mathematica 2.0. Gulf (version 2.2). OR software

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.