IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v7y1999i2p305-322.html
   My bibliography  Save this article

Markovian polling systems with mixed service disciplines and retrial customers

Author

Listed:
  • Christos Langaris

Abstract

No abstract is available for this item.

Suggested Citation

  • Christos Langaris, 1999. "Markovian polling systems with mixed service disciplines and retrial customers," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(2), pages 305-322, December.
    • Handle: RePEc:spr:topjnl:v:7:y:1999:i:2:p:305-322
    DOI: 10.1007/BF02564729
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02564729
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02564729?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. Thomas (Yew Sing) Lee, 1997. "A Closed Form Solution for the Asymmetric Random Polling System with Correlated Levy Input Process," Mathematics of Operations Research, INFORMS, vol. 22(2), pages 432-457, May.
    2. Leonard Kleinrock & Hanoch Levy, 1988. "The Analysis of Random Polling Systems," Operations Research, INFORMS, vol. 36(5), pages 716-732, October.
    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. Bara Kim & Jeongsim Kim, 2019. "Analysis of the waiting time distribution for polling systems with retrials and glue periods," Annals of Operations Research, Springer, vol. 277(2), pages 197-212, June.
    2. Murtuza Ali Abidini & Onno Boxma & Bara Kim & Jeongsim Kim & Jacques Resing, 2017. "Performance analysis of polling systems with retrials and glue periods," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 293-324, December.

    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. Bertsimas, Dimitris., 1995. "The achievable region method in the optimal control of queueing systems : formulations, bounds and policies," Working papers 3837-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Herwig Bruneel & Arnaud Devos, 2024. "Explicit Solutions for Coupled Parallel Queues," Mathematics, MDPI, vol. 12(15), pages 1-31, July.
    3. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case," Economics Working Papers 302, Department of Economics and Business, Universitat Pompeu Fabra, revised Jul 1998.
    4. Tetsuji Hirayama, 2012. "Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms," Annals of Operations Research, Springer, vol. 198(1), pages 83-123, September.
    5. Dieter Fiems & Eitan Altman, 2012. "Gated polling with stationary ergodic walking times, Markovian routing and random feedback," Annals of Operations Research, Springer, vol. 198(1), pages 145-164, September.
    6. Mahender P. Singh & Mandyam M. Srinivasan, 2007. "Performance Bounds for Flexible Systems Requiring Setups," Management Science, INFORMS, vol. 53(6), pages 991-1004, June.
    7. Lee, Thomas (Yew Sing), 1999. "Analysis of infinite servers polling systems with correlated input process and state dependent vacations," European Journal of Operational Research, Elsevier, vol. 115(2), pages 392-412, June.
    8. Germs, Remco & Van Foreest, Nicky D., 2011. "Admission policies for the customized stochastic lot scheduling problem with strict due-dates," European Journal of Operational Research, Elsevier, vol. 213(2), pages 375-383, September.
    9. Jelmer P. Gaast & Ivo J. B. F. Adan & René B. M. Koster, 2017. "The analysis of batch sojourn-times in polling systems," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 313-335, April.
    10. Thomas (Yew Sing) Lee, 1998. "Models for Design and Control of Single Server Polling Computer and Communication Systems," Operations Research, INFORMS, vol. 46(4), pages 515-531, August.
    11. Chydzinski, Andrzej, 2016. "Analysis of the scheduling mechanism for virtualization of links with partial isolation," Applied Mathematics and Computation, Elsevier, vol. 281(C), pages 39-54.

    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:topjnl:v:7:y:1999:i:2:p:305-322. 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.