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

A tractable analytical model for large-scale congested protein synthesis networks

Author

Listed:
  • Osorio, Carolina
  • Bierlaire, Michel

Abstract

This paper presents an analytical model, based on finite capacity queueing network theory, to evaluate congestion in protein synthesis networks. These networks are modeled as a set of single server bufferless queues in a tandem topology. This model proposes a detailed state space formulation, which provides a fine description of congestion and contributes to a better understanding of how the protein synthesis rate is deteriorated. The model approximates the marginal stationary distributions of each queue. It consists of a system of linear and quadratic equations that can be decoupled. The numerical performance of this method is evaluated for networks with up to 100,000 queues, considering scenarios with various levels of congestion. It is a computationally efficient and scalable method that is suitable to evaluate congestion for large-scale networks. Additionally, this paper generalizes the concept of blocking: blocking events can be triggered by an arbitrary set of queues. This generalization allows for a variety of blocking phenomena to be modeled.

Suggested Citation

  • Osorio, Carolina & Bierlaire, Michel, 2012. "A tractable analytical model for large-scale congested protein synthesis networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 588-597.
    • Handle: RePEc:eee:ejores:v:219:y:2012:i:3:p:588-597
    DOI: 10.1016/j.ejor.2011.10.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711009775
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2011.10.037?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Altiok, Tayfur, 1982. "Approximate analysis of exponential tandem queues with blocking," European Journal of Operational Research, Elsevier, vol. 11(4), pages 390-398, December.
    2. 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.
    3. Yves Dallery & Yannick Frein, 1993. "On Decomposition Methods for Tandem Queueing Networks with Blocking," Operations Research, INFORMS, vol. 41(2), pages 386-399, April.
    4. Stanley B. Gershwin, 1987. "An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking," Operations Research, INFORMS, vol. 35(2), pages 291-305, April.
    5. Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.
    6. 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.
    7. Jun, Kyung P. & Perros, Harry G., 1990. "An approximate analysis of open tandem queueing networks with blocking and general service times," European Journal of Operational Research, Elsevier, vol. 46(1), pages 123-135, May.
    8. Laoucine Kerbache & J. Macgregor Smith, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," Post-Print hal-00798811, HAL.
    9. Tayfur Altiok, 1989. "Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking," Operations Research, INFORMS, vol. 37(4), pages 601-610, August.
    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. Carolina Osorio & Michel Bierlaire, 2013. "A Simulation-Based Optimization Framework for Urban Transportation Problems," Operations Research, INFORMS, vol. 61(6), pages 1333-1345, December.
    2. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.

    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. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    2. Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.
    3. Korporaal, R. & Ridder, A.A.N. & Kloprogge, P. & Dekker, R., 1999. "Capacity planning of prisons in the Netherlands," Econometric Institute Research Papers EI 9909-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. 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.
    5. 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.
    6. 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.
    7. Kozlowski, Dawid & Worthington, Dave, 2015. "Use of queue modelling in the analysis of elective patient treatment governed by a maximum waiting time policy," European Journal of Operational Research, Elsevier, vol. 244(1), pages 331-338.
    8. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.
    9. Osorio, Carolina & Flötteröd, Gunnar & Bierlaire, Michel, 2011. "Dynamic network loading: A stochastic differentiable model that derives link state distributions," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1410-1423.
    10. Haskose, A. & Kingsman, B. G. & Worthington, D., 2002. "Modelling flow and jobbing shops as a queueing network for workload control," International Journal of Production Economics, Elsevier, vol. 78(3), pages 271-285, August.
    11. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    12. Eva K. Lee & Siddhartha Maheshwary & Jacquelyn Mason & William Glisson, 2006. "Large-Scale Dispensing for Emergency Response to Bioterrorism and Infectious-Disease Outbreak," Interfaces, INFORMS, vol. 36(6), pages 591-607, December.
    13. Konstantinos S. Boulas & Georgios D. Dounias & Chrissoleon T. Papadopoulos, 2023. "A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 823-852, February.
    14. Chen, Shih-Pin, 2004. "Parametric nonlinear programming for analyzing fuzzy queues with finite capacity," European Journal of Operational Research, Elsevier, vol. 157(2), pages 429-438, September.
    15. Wu, Kan & McGinnis, Leon, 2012. "Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization," European Journal of Operational Research, Elsevier, vol. 221(2), pages 328-339.
    16. Chen, Shih-Pin, 2007. "Solving fuzzy queueing decision problems via a parametric mixed integer nonlinear programming method," European Journal of Operational Research, Elsevier, vol. 177(1), pages 445-457, February.
    17. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    18. Papadopoulos, H. T. & Vidalis, M. I., 2001. "Minimizing WIP inventory in reliable production lines," International Journal of Production Economics, Elsevier, vol. 70(2), pages 185-197, March.
    19. Saied Samiedaluie & Vedat Verter, 2019. "The impact of specialization of hospitals on patient access to care; a queuing analysis with an application to a neurological hospital," Health Care Management Science, Springer, vol. 22(4), pages 709-726, December.
    20. Sagron, Ruth & Pugatch, Rami, 2021. "Universal distribution of batch completion times and time-cost tradeoff in a production line with arbitrary buffer size," European Journal of Operational Research, Elsevier, vol. 293(3), pages 980-989.

    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:219:y:2012:i:3:p:588-597. 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.