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

Spatial birth-death processes with multiple changes and applications to batch service networks and clustering processes

Author

Listed:
  • Boucherie, R.J.

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

  • Dijk, N.M. van

Abstract

No abstract is available for this item.

Suggested Citation

  • Boucherie, R.J. & Dijk, N.M. van, 1988. "Spatial birth-death processes with multiple changes and applications to batch service networks and clustering processes," Serie Research Memoranda 0055, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    • Handle: RePEc:vua:wpaper:1988-55
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Dijk, N.M. van, 1988. "Closed queueing networks with batch services," Serie Research Memoranda 0050, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    2. B. Pittel, 1979. "Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 357-378, November.
    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. Boucherie, R.J. & Dijk, N.M. van, 1989. "Product forms for queueing networks with state dependent multiple job transitions," Serie Research Memoranda 0022, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.

    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. Boucherie, R.J. & Dijk, N.M. van, 1989. "Product forms for queueing networks with state dependent multiple job transitions," Serie Research Memoranda 0022, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    2. Dijk, N.M. van, 1989. "An insensitive product form for discrete-time communication networks," Serie Research Memoranda 0091, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    3. Dijk, N.M. van, 1991. "A product form extension fot discrete-time communication protocols," Serie Research Memoranda 0008, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    4. Dijk, N.M. van, 1989. "Product forms for queueing networks with limited clusters," Serie Research Memoranda 0029, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    5. Dijk, N.M. van, 1991. "Product forms for queueing networks with limited clusters," Serie Research Memoranda 0013, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    6. Anselmi, Jonatha & D'Auria, Bernardo & Walton, Neil, 2012. "Closed queueing networks under congestion: non-bottleneck independence and bottleneck convergence," DES - Working Papers. Statistics and Econometrics. WS ws121711, Universidad Carlos III de Madrid. Departamento de Estadística.
    7. Zeifman, A.I. & Razumchik, R.V. & Satin, Y.A. & Kovalev, I.A., 2021. "Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    8. van Dijk, N.M. & van der Sluis, E. & Bulder, L.N. & Cui, Y., 2024. "Flexible serial capacity allocation with intensive care application," International Journal of Production Economics, Elsevier, vol. 272(C).
    9. Jonatha Anselmi & Bernardo D'Auria & Neil Walton, 2013. "Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 469-491, August.
    10. Nico Dijk & Barteld Schilstra, 2022. "On two product form modifications for finite overflow systems," Annals of Operations Research, Springer, vol. 310(2), pages 519-549, March.
    11. Dijk, N.M. van, 1989. "On 'stop=repeat' servicing for non-exponential queueing networks with blocking," Serie Research Memoranda 0023, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    12. J. P. van der Gaast & M. B. M. de Koster & I. J. B. F. Adan, 2018. "Conveyor Merges in Zone Picking Systems: A Tractable and Accurate Approximate Model," Service Science, INFORMS, vol. 52(6), pages 1428-1443, December.
    13. Boucherie, R.J. & Dijk, N.M. van, 1992. "Local balance in queueing networks with positive and negative customers," Serie Research Memoranda 0001, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    14. Jelmer P. van der Gaast & René B. M. de Koster & Ivo J. B. F. Adan & Jacques A. C. Resing, 2020. "Capacity Analysis of Sequential Zone Picking Systems," Operations Research, INFORMS, vol. 68(1), pages 161-179, January.
    15. Dijk, N.M. van, 1989. "'Stop = recirculate' for exponential product form queueing networks with departure blocking," Serie Research Memoranda 0011, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    16. Dijk, N.M. van, 1988. "Product forms for queueing networks with limited clusters," Serie Research Memoranda 0052, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.

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