IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v61y2015i2p316-334.html

Appointment Scheduling with Limited Distributional Information

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Minglong Zhou & Gar Goei Loke & Chaithanya Bandi & Zi Qiang Glen Liau & Wilson Wang, 2022. "Intraday Scheduling with Patient Re-entries and Variability in Behaviours," Manufacturing & Service Operations Management, INFORMS, vol. 24(1), pages 561-579, January.
  2. 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.
  3. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
  4. Mahes, Roshan & Mandjes, Michel & Boon, Marko & Taylor, Peter, 2024. "Adaptive scheduling in service systems: A Dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 312(2), pages 605-626.
  5. 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.
  6. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.
  7. Alex Kuiper & Robert H. Lee, 2022. "Appointment Scheduling for Multiple Servers," Management Science, INFORMS, vol. 68(10), pages 7422-7440, October.
  8. Zhengchao Wang & Heikki Peura & Wolfram Wiesemann, 2024. "Randomized Assortment Optimization," Operations Research, INFORMS, vol. 72(5), pages 2042-2060, September.
  9. Jun Cai & Jonathan Yu-Meng Li & Tiantian Mao, 2025. "Distributionally Robust Optimization Under Distorted Expectations," Operations Research, INFORMS, vol. 73(2), pages 969-985, March.
  10. Amir Ardestani-Jaafari & Erick Delage, 2016. "Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems," Operations Research, INFORMS, vol. 64(2), pages 474-494, April.
  11. 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.
  12. Wu, Xueqi & Zhou, Shenghai, 2022. "Sequencing and scheduling appointments on multiple servers with stochastic service durations and customer arrivals," Omega, Elsevier, vol. 106(C).
  13. Jin Qi, 2017. "Mitigating Delays and Unfairness in Appointment Systems," Management Science, INFORMS, vol. 63(2), pages 566-583, February.
  14. Carolin Bauerhenne & Rainer Kolisch & Andreas S. Schulz, 2024. "Robust Appointment Scheduling with Waiting Time Guarantees," Papers 2402.12561, arXiv.org, revised Jan 2026.
  15. Zhaowei Hao & Long He & Zhenyu Hu & Jun Jiang, 2025. "Robust Capacity Planning with General Upgrading," Manufacturing & Service Operations Management, INFORMS, vol. 27(6), pages 1975-1994, November.
  16. Louis Chen & Will Ma & Karthik Natarajan & David Simchi-Levi & Zhenzhen Yan, 2022. "Distributionally Robust Linear and Discrete Optimization with Marginals," Operations Research, INFORMS, vol. 70(3), pages 1822-1834, May.
  17. Yuan Gao & Qian Zhang & Chun Kit Lau & Bhagwat Ram, 2022. "Robust Appointment Scheduling in Healthcare," Mathematics, MDPI, vol. 10(22), pages 1-15, November.
  18. Behrooz Pourghannad & Guihua Wang, 2025. "Matching Patients with Surgeons: Heterogeneous Effects of Surgical Volume on Surgery Duration," Manufacturing & Service Operations Management, INFORMS, vol. 27(4), pages 1037-1052, July.
  19. 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, revised May 2026.
  20. Yu Wang & Yu Zhang & Minglong Zhou & Jiafu Tang, 2023. "Feature‐driven robust surgery scheduling," Production and Operations Management, Production and Operations Management Society, vol. 32(6), pages 1921-1938, June.
  21. van Eekelen, Wouter & den Hertog, Dick & van Leeuwaarden, J.S.H., 2025. "Distributionally robust appointment scheduling that can deal with independent service times," Other publications TiSEM e6ac8cc7-43c6-42c6-9e11-f, Tilburg University, School of Economics and Management.
  22. Kuiper, Alex & de Mast, Jeroen & Mandjes, Michel, 2021. "The problem of appointment scheduling in outpatient clinics: A multiple case study of clinical practice," Omega, Elsevier, vol. 98(C).
  23. Range, Troels Martin & Kozlowski, Dawid & Petersen, Niels Chr., 2019. "Dynamic job assignment: A column generation approach with an application to surgery allocation," European Journal of Operational Research, Elsevier, vol. 272(1), pages 78-93.
  24. Yu Fu & Amarnath Banerjee, 2021. "A Stochastic Programming Model for Service Scheduling with Uncertain Demand: an Application in Open-Access Clinic Scheduling," SN Operations Research Forum, Springer, vol. 2(3), pages 1-32, September.
  25. Tine Meersman & Broos Maenhout, 2025. "A decomposition-based approach for multi-level appointment planning and scheduling," Health Care Management Science, Springer, vol. 28(3), pages 478-504, September.
  26. Chun Cheng & Yossiri Adulyasak & Louis-Martin Rousseau, 2024. "Robust Drone Delivery with Weather Information," Manufacturing & Service Operations Management, INFORMS, vol. 26(4), pages 1402-1421, July.
  27. Saif Benjaafar & David Chen & Rowan Wang & Zhenzhen Yan, 2023. "Appointment Scheduling Under a Service-Level Constraint," Manufacturing & Service Operations Management, INFORMS, vol. 25(1), pages 70-87, January.
  28. Ji, Menglei & Wang, Shanshan & Peng, Chun & Li, Jinlin, 2025. "Robust doctor–patient assignment with endogenous service duration uncertainty and no-show behavior," Omega, Elsevier, vol. 133(C).
  29. Qiuzhuang Sun & Piao Chen & Xin Wang & Zhi‐Sheng Ye, 2023. "Robust condition‐based production and maintenance planning for degradation management," Production and Operations Management, Production and Operations Management Society, vol. 32(12), pages 3951-3967, December.
  30. Madelon A. de Kemp & Michel Mandjes & Neil Olver, 2021. "Performance of the Smallest-Variance-First Rule in Appointment Sequencing," Operations Research, INFORMS, vol. 69(6), pages 1909-1935, November.
  31. Zhen Sun & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2017. "Not Just a Fad: Optimal Sequencing in Mobile In-App Advertising," Information Systems Research, INFORMS, vol. 28(3), pages 511-528, September.
  32. Zhang, Abraham & Zheng, Zhichao & Teo, Chung-Piaw, 2022. "Schedule reliability in liner shipping timetable design: A convex programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 499-525.
  33. Yan Deng & Siqian Shen & Brian Denton, 2019. "Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 559-575, July.
  34. Meersman, Tine & Maenhout, Broos & Fiems, Dieter, 2025. "Dynamic appointment rescheduling with patient preferences," European Journal of Operational Research, Elsevier, vol. 326(3), pages 498-514.
  35. Liu, Kanglin & Li, Qiaofeng & Zhang, Zhi-Hai, 2019. "Distributionally robust optimization of an emergency medical service station location and sizing problem with joint chance constraints," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 79-101.
  36. Weiwei Fan & L. Jeff Hong & Xiaowei Zhang, 2020. "Distributionally Robust Selection of the Best," Management Science, INFORMS, vol. 66(1), pages 190-208, January.
  37. Tsang, Man Yiu & Shehadeh, Karmel S., 2023. "Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times," European Journal of Operational Research, Elsevier, vol. 307(1), pages 48-63.
  38. Kong, Qingxia & Lee, Chung-Yee & Teo, Chung-Piaw & Zheng, Zhichao, 2016. "Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal," European Journal of Operational Research, Elsevier, vol. 255(3), pages 809-821.
  39. You Hui Goh & Zihao Li & Zhenzhen Yan, 2025. "Strategic Idling in Appointment Systems with Sequential Servers," Manufacturing & Service Operations Management, INFORMS, vol. 27(3), pages 955-974, May.
  40. Lu, Haimin & Pei, Zhi, 2023. "Single machine scheduling with release dates: A distributionally robust approach," European Journal of Operational Research, Elsevier, vol. 308(1), pages 19-37.
  41. Shuming Wang & Jun Li & Marcus Ang & Tsan Sheng Ng, 2024. "Appointment Scheduling with Delay Tolerance Heterogeneity," INFORMS Journal on Computing, INFORMS, vol. 36(5), pages 1201-1224, September.
  42. Kuiper, Alex & Mandjes, Michel, 2015. "Appointment scheduling in tandem-type service systems," Omega, Elsevier, vol. 57(PB), pages 145-156.
  43. 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.
  44. Pardis Seyedi & Michael W. Carter & Kourosh Eshghi, 2025. "Central intake optimization and decentralized decomposition for appointment scheduling and sequencing," Flexible Services and Manufacturing Journal, Springer, vol. 37(1), pages 208-253, March.
  45. Oualid Jouini & Saif Benjaafar & Bingnan Lu & Siqiao Li & Benjamin Legros, 2022. "Appointment-driven queueing systems with non-punctual customers," Queueing Systems: Theory and Applications, Springer, vol. 101(1), pages 1-56, June.
  46. Avishai Mandelbaum & Petar Momčilović & Nikolaos Trichakis & Sarah Kadish & Ryan Leib & Craig A. Bunnell, 2020. "Data-Driven Appointment-Scheduling Under Uncertainty: The Case of an Infusion Unit in a Cancer Center," Management Science, INFORMS, vol. 66(1), pages 243-270, January.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.