IDEAS home Printed from
   My bibliography  Save this paper

Histogram based bounds and approximations for production lines


  • TRAZNCREZ, Jean-Sébastien
  • SEMAL, Pierre
  • CHEVALIER, Philippe


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.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • TRAZNCREZ, Jean-Sébastien & SEMAL, Pierre & CHEVALIER, Philippe, 2009. "Histogram based bounds and approximations for production lines," CORE Discussion Papers RP 2163, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvrp:2163 Note: In : European Journal of Operational Research, 197, 1133-1141, 2009

    Download full text from publisher

    File URL:
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    1. 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.
    2. 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.
    3. 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.
    4. Laoucine Kerbache & J. Macgregor Smith, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," Post-Print hal-00798811, HAL.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Liu, Jialu & Yang, Sheng & Wu, Aiguo & Hu, S. Jack, 2012. "Multi-state throughput analysis of a two-stage manufacturing system with parallel unreliable machines and a finite buffer," European Journal of Operational Research, Elsevier, vol. 219(2), pages 296-304.

    More about this item


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvrp:2163. 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: (Alain GILLIS). General contact details of provider: .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.