Histogram based bounds and approximations for production lines
We present a modelling method for the analysis of production lines with generally distributed processing times and finite buffers. We consider the complete modelling process, from the data collection to the performance evaluation. First, the data about the processing times is supposed to be collected in the form of histograms. Second, tractable discrete phase-type distributions are built. Third, the evolution of the production line is described by a Markov chain, using a state model. Our originality mostly comes from the way the phase-type distributions are built: the "grouping at the end" discretization aggregates the probability mass in a time step at its end. The method allows to compute refinable upper and lower bounds on the throughput. Furthermore, we propose some approximations and show how the method performs on simple examples. We argue that the way the distributions are discretized, called "probability masses fitting", can be thought as a valuable alternative in order to build tractable distributions.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
- Kerbache, Laoucine & Smith, J. MacGregor, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," European Journal of Operational Research, Elsevier, vol. 121(1), pages 105-123, February.
- Gourgand, Michel & Grangeon, Nathalie & Norre, Sylvie, 2005. "Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity," European Journal of Operational Research, Elsevier, vol. 161(1), pages 126-147, February.
- Laoucine Kerbache & J. Macgregor Smith, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," Post-Print hal-00798811, HAL.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:197:y:2009:i:3:p:1133-1141. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.