Analysis of the Fork-Join Queue
IEEE Transactions on Computers
A review of L=&lgr;W and extensions
Queueing Systems: Theory and Applications
Performance modeling of automated manufacturing systems
Performance modeling of automated manufacturing systems
Properties of serial kanban systems
Queueing Systems: Theory and Applications
Numerical Recipes in C: The Art of Scientific Computing
Numerical Recipes in C: The Art of Scientific Computing
Performance analysis of a kitting process in stochastic assembly systems
Computers and Operations Research
Buffer size design linked to reliability performance: A simulative study
Computers and Industrial Engineering
Optimization of buffer-size allocation using dynamic programming in assembly-like systems
ICOSSSE'10 Proceedings of the 9th WSEAS international conference on System science and simulation in engineering
Lead time control in multi-class multi-stage assembly systems with finite capacity
Computers and Industrial Engineering
| Hi-index | 0.01 |
This paper considers a finite capacity fork-join queueing model for open assembly systems with arrival and departure synchronizations and presents an approach for enumerating the state space and obtaining the steady state probabilities of the same for such a model under exponential assumptions. Several performance measures like the throughput of the system, fraction of arrivals that actually enter into the system, utilizations of the work stations, etc., are obtained. Further, design of such fork-join systems in terms of buffer size configurations for maximizing the throughput of the system, or for minimizing the mean waiting time of a typical job, or for minimizing the Work-In-Process of the system is done using the above performance prediction approach. Such optimal configurations exhibit some interesting features.