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

Networks with mixed processor sharing parallel queues and common pools

Author

Listed:
  • Dijk, J.N.

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

  • Akyildiz, I.F.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:vua:wpaper:1988-23
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    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. 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.
    2. 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.
    3. Saulius Minkevičius & Igor Katin & Joana Katina & Irina Vinogradova-Zinkevič, 2021. "On Little’s Formula in Multiphase Queues," Mathematics, MDPI, vol. 9(18), pages 1-15, September.
    4. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    5. 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.
    6. Pradhan, Salil & Damodaran, Purushothaman & Srihari, Krishnaswami, 2008. "Predicting performance measures for Markovian type of manufacturing systems with product failures," European Journal of Operational Research, Elsevier, vol. 184(2), pages 725-744, January.
    7. Girish, Muckai K. & Hu, Jian-Qiang, 2000. "Higher order approximations for the single server queue with splitting, merging and feedback," European Journal of Operational Research, Elsevier, vol. 124(3), pages 447-467, August.
    8. 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.
    9. van Ackere, Ann, 1995. "Capacity management: Pricing strategy, performance and the role of information," International Journal of Production Economics, Elsevier, vol. 40(1), pages 89-100, June.
    10. Sauer Cornelia & Daduna Hans, 2003. "Availability Formulas and Performance Measures for Separable Degradable Networks," Stochastics and Quality Control, De Gruyter, vol. 18(2), pages 165-194, January.
    11. Flötteröd, G. & Osorio, C., 2017. "Stochastic network link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 180-209.
    12. 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.
    13. 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.
    14. 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.
    15. Lin, Yu-Hsin & Lee, Ching-En, 2001. "A total standard WIP estimation method for wafer fabrication," European Journal of Operational Research, Elsevier, vol. 131(1), pages 78-94, May.
    16. 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.
    17. 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.
    18. John S. Hollywood, 2005. "An approximate planning model for distributed computing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 590-605, September.
    19. Leon Yang Chu & Zhixi Wan & Dongyuan Zhan, 2018. "Harnessing the Double-edged Sword via Routing: Information Provision on Ride-hailing Platforms," Working Papers 18-04, NET Institute.
    20. Benjamini, I. & Ferrari, P. A. & Landim, C., 1996. "Asymmetric conservative processes with random rates," Stochastic Processes and their Applications, Elsevier, vol. 61(2), pages 181-204, February.

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