IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v161y2005i1p126-147.html
   My bibliography  Save this article

Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity

Author

Listed:
  • Gourgand, Michel
  • Grangeon, Nathalie
  • Norre, Sylvie

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:161:y:2005:i:1:p:126-147
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00536-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gourgand, Michel & Grangeon, Nathalie & Norre, Sylvie, 2003. "A contribution to the stochastic flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 415-433, December.
    2. Kamburowski, Jerzy, 1999. "Stochastically minimizing the makespan in two-machine flow shops without blocking," European Journal of Operational Research, Elsevier, vol. 112(2), pages 304-309, January.
    3. V. G. Kulkarni & V. G. Adlakha, 1986. "Markov and Markov-Regenerative pert Networks," Operations Research, INFORMS, vol. 34(5), pages 769-781, October.
    4. Kamburowski, Jerzy, 2000. "On three-machine flow shops with random job processing times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 440-448, September.
    5. Michael Pinedo, 1982. "Minimizing the Expected Makespan in Stochastic Flow Shops," Operations Research, INFORMS, vol. 30(1), pages 148-162, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Jean-Sébastien Tancrez, 2020. "A decomposition method for assembly/disassembly systems with blocking and general distributions," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 272-296, June.
    2. Tancrez, Jean-Sbastien & Semal, Pierre & Chevalier, Philippe, 2009. "Histogram based bounds and approximations for production lines," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1133-1141, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. J Jackman & Z Guerra de Castillo & S Olafsson, 2011. "Stochastic flow shop scheduling model for the Panama Canal," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 69-80, January.
    2. P J Kalczynski & J Kamburowski, 2004. "Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1358-1362, December.
    3. Gourgand, Michel & Grangeon, Nathalie & Norre, Sylvie, 2003. "A contribution to the stochastic flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 415-433, December.
    4. Portougal, Victor & Trietsch, Dan, 2006. "Johnson's problem with stochastic processing times and optimal service level," European Journal of Operational Research, Elsevier, vol. 169(3), pages 751-760, March.
    5. Kamburowski, Jerzy, 2000. "On three-machine flow shops with random job processing times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 440-448, September.
    6. Baker, Kenneth R. & Altheimer, Dominik, 2012. "Heuristic solution methods for the stochastic flow shop problem," European Journal of Operational Research, Elsevier, vol. 216(1), pages 172-177.
    7. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    8. Azaron, Amir & Fatemi Ghomi, S.M.T., 2008. "Lower bound for the mean project completion time in dynamic PERT networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 120-127, April.
    9. Junguang Zhang & Dan Wan, 2021. "Determination of early warning time window for bottleneck resource buffer," Annals of Operations Research, Springer, vol. 300(1), pages 289-305, May.
    10. Azaron, Amir & Fynes, Brian & Modarres, Mohammad, 2011. "Due date assignment in repetitive projects," International Journal of Production Economics, Elsevier, vol. 129(1), pages 79-85, January.
    11. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Longest path analysis in networks of queues: Dynamic scheduling problems," European Journal of Operational Research, Elsevier, vol. 174(1), pages 132-149, October.
    12. Williams, Terry, 1999. "Towards realism in network simulation," Omega, Elsevier, vol. 27(3), pages 305-314, June.
    13. Vaseghi, Forough & Martens, Annelies & Vanhoucke, Mario, 2024. "Analysis of the impact of corrective actions for stochastic project networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 503-518.
    14. Elmaghraby, S. E. & Ferreira, A. A. & Tavares, L. V., 2000. "Optimal start times under stochastic activity durations," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 153-164, March.
    15. Alessio Angius & András Horváth & Marcello Urgo, 2021. "A Kronecker Algebra Formulation for Markov Activity Networks with Phase-Type Distributions," Mathematics, MDPI, vol. 9(12), pages 1-22, June.
    16. Charles Du & Michael Pinedo, 1995. "A note on minimizing the expected makespan in flowshops subject to breakdowns," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(8), pages 1251-1262, December.
    17. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 2002. "Optimal job-shop scheduling with random operations and cost objectives," International Journal of Production Economics, Elsevier, vol. 76(2), pages 147-157, March.
    18. Gary Mitchell, 2010. "On Calculating Activity Slack in Stochastic Project Networks," American Journal of Economics and Business Administration, Science Publications, vol. 2(1), pages 78-85, March.
    19. R. Alan Bowman, 2003. "Sensitivity curves for effective project management," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 481-497, August.
    20. Lee, Kangbok & Zheng, Feifeng & Pinedo, Michael L., 2019. "Online scheduling of ordered flow shops," European Journal of Operational Research, Elsevier, vol. 272(1), pages 50-60.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:eee:ejores:v:161:y:2005:i:1:p:126-147. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.