IDEAS home Printed from https://ideas.repec.org/p/vua/wpaper/1988-5.html
   My bibliography  Save this paper

Networks of queues with service anticipating routing

Author

Listed:
  • Dijk, N.M. van

    (Vrije Universiteit Amsterdam, Faculteit der Economische Wetenschappen en Econometrie (Free University Amsterdam, Faculty of Economics Sciences, Business Administration and Economitrics)

  • Rumsewicz, M.

Abstract

No abstract is available for this item.

Suggested Citation

  • Dijk, N.M. van & Rumsewicz, M., 1988. "Networks of queues with service anticipating routing," Serie Research Memoranda 0005, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    • Handle: RePEc:vua:wpaper:1988-5
    as

    Download full text from publisher

    File URL: http://degree.ubvu.vu.nl/repec/vua/wpaper/pdf/19880005.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. James R. Jackson, 1957. "Networks of Waiting Lines," Operations Research, INFORMS, vol. 5(4), pages 518-521, August.
    Full references (including those not matched with items on IDEAS)

    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. Ward Whitt & Wei You, 2022. "New decomposition approximations for queueing networks," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 365-367, April.
    2. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    3. 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.
    4. Flötteröd, G. & Osorio, C., 2017. "Stochastic network link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 180-209.
    5. 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.
    6. 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.
    7. Sumi Kim & Seongmoon Kim, 2015. "Differentiated waiting time management according to patient class in an emergency care center using an open Jackson network integrated with pooling and prioritizing," Annals of Operations Research, Springer, vol. 230(1), pages 35-55, July.
    8. Li, Yongli & Gao, Xin & Xu, Zhiwei & Zhou, Xuanrui, 2018. "Network-based queuing model for simulating passenger throughput at an airport security checkpoint," Journal of Air Transport Management, Elsevier, vol. 66(C), pages 13-24.
    9. Ward Whitt & Wei You, 2020. "Heavy-traffic limits for stationary network flows," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 53-68, June.
    10. Hum, Sin-Hoon & Parlar, Mahmut & Zhou, Yun, 2018. "Measurement and optimization of responsiveness in supply chain networks with queueing structures," European Journal of Operational Research, Elsevier, vol. 264(1), pages 106-118.
    11. Yasushi Masuda & Seungjin Whang, 1999. "Dynamic Pricing for Network Service: Equilibrium and Stability," Management Science, INFORMS, vol. 45(6), pages 857-869, June.
    12. Haskose, A. & Kingsman, B. G. & Worthington, D, 2004. "Performance analysis of make-to-order manufacturing systems under different workload control regimes," International Journal of Production Economics, Elsevier, vol. 90(2), pages 169-186, July.
    13. 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.
    14. Bretthauer, Kurt M., 1996. "Capacity planning in manufacturing and computer networks," European Journal of Operational Research, Elsevier, vol. 91(2), pages 386-394, June.
    15. 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.
    16. Daduna, Hans & Szekli, Ryszard, 1996. "A queueing theoretical proof of increasing property of Polya frequency functions," Statistics & Probability Letters, Elsevier, vol. 26(3), pages 233-242, February.
    17. Veneklaas, W. & Leeftink, A.G. & van Boekel, P.H.C.M. & Hans, E.W., 2021. "On the design, implementation, and feasibility of hospital admission services: The admission lounge case," Omega, Elsevier, vol. 100(C).
    18. Gurami Tsitsiashvili, 2021. "Construction and Analysis of Queuing and Reliability Models Using Random Graphs," Mathematics, MDPI, vol. 9(19), pages 1-14, October.
    19. Xu Sun & Ward Whitt, 2018. "Creating Work Breaks from Available Idleness," Manufacturing & Service Operations Management, INFORMS, vol. 20(4), pages 721-736, October.
    20. Andjel, E. D. & Ferrari, P. A. & Guiol, H. & Landim *, C., 2000. "Convergence to the maximal invariant measure for a zero-range process with random rates," Stochastic Processes and their Applications, Elsevier, vol. 90(1), pages 67-81, November.

    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:vua:wpaper:1988-5. 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: R. Dam (email available below). General contact details of provider: https://edirc.repec.org/data/fewvunl.html .

    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.