IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v62y2005i3p429-436.html
   My bibliography  Save this article

On product form tandem structures

Author

Listed:
  • Nico Dijk

Abstract

This paper is written in honour to A. Hordijk. It establishes product form results for a generic and instructive multi-class tandem queue with blocking, to which A. Hordijk has directly and indirectly contributed. First, a sufficient and necessary product form characterization is provided. Next, three special cases are briefly presented. These illustrate the possibility of product forms despite finite capacity constraints (blocking), unproportional processor sharing mechanisms and resource contentions (such as for access control). The results are partially new and of interest for present-day applications. In essence these rely upon the pioneering work by A. Hordijk Copyright Springer-Verlag 2005

Suggested Citation

  • Nico Dijk, 2005. "On product form tandem structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 429-436, December.
    • Handle: RePEc:spr:mathme:v:62:y:2005:i:3:p:429-436
    DOI: 10.1007/s00186-005-0043-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-005-0043-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-005-0043-3?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. Nico van Dijk, 1998. "Bounds and error bounds for queueing networks," Annals of Operations Research, Springer, vol. 79(0), pages 295-319, January.
    2. Hordijk, A. & Schassberger, R., 1982. "Weak convergence for generalized semi-Markov processes," Stochastic Processes and their Applications, Elsevier, vol. 12(3), pages 271-291, May.
    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. Dijk, N.M. van, 1988. "A LCFS finite buffer model with batch input and non-exponential services," Serie Research Memoranda 0007, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    2. Nico M. van Dijk & Erik van der Sluis, 2001. "Simple Product-Form Bounds for Queueing Networks with Finite Clusters," Tinbergen Institute Discussion Papers 01-107/4, Tinbergen Institute.
    3. Dijk, N.M. van, 1988. "Error bounds for comparing open and closed queueing networks with an application to performability analysis," Serie Research Memoranda 0056, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    4. Dijk, N.M. van, 1987. "A LCFS finite buffer model with finite source batch input," Serie Research Memoranda 0049, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    5. Dijk, N.M. van, 1989. "An equivalence of communication protocols for interconnection networks," Serie Research Memoranda 0034, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    6. Dijk, N.M. van, 1991. "Product forms for metropolitan area networks," Serie Research Memoranda 0007, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    7. Richard J. Boucherie & Nico M. van Dijk, 2000. "On a Queueing Network Model for Cellular Mobile Telecommunications Networks," Operations Research, INFORMS, vol. 48(1), pages 38-49, February.
    8. 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.
    9. Ana Bušić & Ingrid Vliegen & Alan Scheller-Wolf, 2012. "Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 259-287, May.
    10. 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.
    11. Dijk, N.M. van, 1989. "A note on extended uniformization for non-exponential stochastic networks," Serie Research Memoranda 0026, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    12. Nico M. van Dijk & Masakiyo Miyazawa, 2004. "Error Bounds for Perturbing Nonexponential Queues," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 525-558, August.
    13. Niek Baer & Richard J. Boucherie & Jan-Kees C. W. van Ommeren, 2019. "Threshold Queueing to Describe the Fundamental Diagram of Uninterrupted Traffic," Transportation Science, INFORMS, vol. 53(2), pages 585-596, March.
    14. Dijk, J.N. & Akyildiz, I.F., 1988. "Networks with mixed processor sharing parallel queues and common pools," Serie Research Memoranda 0023, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    15. 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).
    16. Ke Fu & Vernon N. Hsu & Chung‐Yee Lee, 2011. "Approximation methods for the analysis of a multicomponent, multiproduct assemble‐to‐order system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(7), pages 685-704, October.

    More about this item

    Keywords

    Tandem queues; Product forms; 60K25; 90B22;
    All these keywords.

    JEL classification:

    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:spr:mathme:v:62:y:2005:i:3:p:429-436. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.