IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v100y2022i3d10.1007_s11134-022-09810-6.html
   My bibliography  Save this article

Distributionally robust views on extremal queues

Author

Listed:
  • Wouter Eekelen

    (Department of Econometrics and Operations Research, Tilburg University)

  • Johan S. H. Leeuwaarden

    (Department of Econometrics and Operations Research, Tilburg University)

Abstract

No abstract is available for this item.

Suggested Citation

  • Wouter Eekelen & Johan S. H. Leeuwaarden, 2022. "Distributionally robust views on extremal queues," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 485-487, April.
    • Handle: RePEc:spr:queues:v:100:y:2022:i:3:d:10.1007_s11134-022-09810-6
    DOI: 10.1007/s11134-022-09810-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-022-09810-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-022-09810-6?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. Qingxia Kong & Chung-Yee Lee & Chung-Piaw Teo & Zhichao Zheng, 2013. "Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones," Operations Research, INFORMS, vol. 61(3), pages 711-726, June.
    2. Yan Chen & Ward Whitt, 2021. "Extremal GI/GI/1 queues given two moments: exploiting Tchebycheff systems," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 101-124, February.
    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. Hanley, Brenda J. & Carstensen, Michelle & Walsh, Daniel P. & Christensen, Sonja A. & Storm, Daniel J. & Booth, James G. & Guinness, Joseph & Them, Cara E. & Ahmed, Md Sohel & Schuler, Krysten L., 2022. "Informing Surveillance through the Characterization of Outbreak Potential of Chronic Wasting Disease in White-Tailed Deer," Ecological Modelling, Elsevier, vol. 471(C).
    2. Ariel Neufeld & Matthew Ng Cheng En & Ying Zhang, 2024. "Robust SGLD algorithm for solving non-convex distributionally robust optimisation problems," Papers 2403.09532, arXiv.org.

    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. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    2. Shenghai Zhou & Yichuan Ding & Woonghee Tim Huh & Guohua Wan, 2021. "Constant Job‐Allowance Policies for Appointment Scheduling: Performance Bounds and Numerical Analysis," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2211-2231, July.
    3. Weiwei Fan & L. Jeff Hong & Xiaowei Zhang, 2020. "Distributionally Robust Selection of the Best," Management Science, INFORMS, vol. 66(1), pages 190-208, January.
    4. Shen, Zuo-Jun Max & Xie, Jingui & Zheng, Zhichao & Zhou, Han, 2023. "Dynamic scheduling with uncertain job types," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1047-1060.
    5. Bomze, Immanuel M. & Gabl, Markus, 2023. "Optimization under uncertainty and risk: Quadratic and copositive approaches," European Journal of Operational Research, Elsevier, vol. 310(2), pages 449-476.
    6. Yong Liang & Mengshi Lu & Zuo‐Jun Max Shen & Runyu Tang, 2021. "Data Center Network Design for Internet‐Related Services and Cloud Computing," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2077-2101, July.
    7. Tito Homem-de-Mello & Qingxia Kong & Rodrigo Godoy-Barba, 2022. "A Simulation Optimization Approach for the Appointment Scheduling Problem with Decision-Dependent Uncertainties," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2845-2865, September.
    8. Riley Badenbroek & Etienne de Klerk, 2022. "An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1115-1125, March.
    9. Jin Qi, 2017. "Mitigating Delays and Unfairness in Appointment Systems," Management Science, INFORMS, vol. 63(2), pages 566-583, February.
    10. Frantisek Kuda & Petr Dlask & Marek Teichmann & Vaclav Beran, 2022. "Time–Cost Schedules and Project–Threats Indication," Sustainability, MDPI, vol. 14(5), pages 1-16, February.
    11. Areesh Mittal & Can Gokalp & Grani A. Hanasusanto, 2020. "Robust Quadratic Programming with Mixed-Integer Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 201-218, April.
    12. Shehadeh, Karmel S. & Cohn, Amy E.M. & Jiang, Ruiwei, 2020. "A distributionally robust optimization approach for outpatient colonoscopy scheduling," European Journal of Operational Research, Elsevier, vol. 283(2), pages 549-561.
    13. Badenbroek, Riley & de Klerk, Etienne, 2020. "An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix," Other publications TiSEM 876ff1ab-036c-4635-9688-1, Tilburg University, School of Economics and Management.
    14. Arlen Dean & Amirhossein Meisami & Henry Lam & Mark P. Van Oyen & Christopher Stromblad & Nick Kastango, 2022. "Quantile regression forests for individualized surgery scheduling," Health Care Management Science, Springer, vol. 25(4), pages 682-709, December.
    15. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    16. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    17. Zheng Zhang & Brian T. Denton & Xiaolan Xie, 2020. "Branch and Price for Chance-Constrained Bin Packing," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 547-564, July.
    18. Christos Zacharias & Tallys Yunes, 2020. "Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs," Management Science, INFORMS, vol. 66(2), pages 744-763, February.
    19. Long He & Ho-Yin Mak & Ying Rong & Zuo-Jun Max Shen, 2017. "Service Region Design for Urban Electric Vehicle Sharing Systems," Manufacturing & Service Operations Management, INFORMS, vol. 19(2), pages 309-327, May.
    20. Ahmadi-Javid, Amir & Jalali, Zahra & Klassen, Kenneth J, 2017. "Outpatient appointment systems in healthcare: A review of optimization studies," European Journal of Operational Research, Elsevier, vol. 258(1), pages 3-34.

    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:spr:queues:v:100:y:2022:i:3:d:10.1007_s11134-022-09810-6. 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.