Modeling, Simulation and Performance Analysis of a Flexible Production System
Keywords:
Queueing models, flexible production systems, modeling, simulation, stabilityAbstract
This paper deals with a flexible production system modeled by re-entrant queueing network; a system decomposed into two fundamental multi-productive stations and three classes, a part follows the route fixed by the system, where each one is processed first by station 1 for the first step, then by station 2 for the second step, and again by the first station for third and last step before leaving the system.
We assume that there is an infinite supply of work available, so that there are always parts ready for processing step 1, and that the first station gives preemptive priority to buffer 3.
Several performance measures have been used to evaluate the system performances considering two scenarios; high priority with service conservation and high priority with loss of parts. So, performances due to varying its parameters are investigated through expanded Monte Carlo simulations.
Downloads
Published
Issue
Section
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.