Journal article · 2026 · Open access

Robust Appointment Scheduling with Waiting Time Guarantees

Carolin Bauerhenne, Rainer Kolisch, Andreas S. Schulz

Manufacturing & Service Operations Management, 28(3), 995–1009 · Published 5 January 2026 · DOI 10.1287/msom.2024.0852

Open PDFView at the publisherCite this paper

In brief

“Robust Appointment Scheduling with Waiting Time Guarantees” is a 2026 journal article by Carolin Bauerhenne and 2 co-authors, published in Manufacturing & Service Operations Management. OpenAlex counts 10 citations as of 17 November 2026, which puts it in the top 4% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).

Citations
10
Most cited in
2026 (6)
Field-weighted impact
15.90
References
48
Authors
3

Abstract

Problem definition: Appointment scheduling problems under uncertainty encounter a fundamental trade-off between cost minimization and customer waiting times. Most existing studies address this trade-off using a weighted sum approach, which puts little emphasis on individual waiting times and, thus, customer satisfaction. In contrast, we study how to minimize total cost while providing waiting time guarantees to all customers. Methodology/results: Given box uncertainty sets for service times and no-shows, we introduce the robust appointment scheduling problem with waiting time guarantees. We show that the problem is [Formula: see text]-hard in general and introduce a mixed-integer linear program that can be solved in reasonable computation time. For special cases, we prove that polynomial-time variants of the well-known smallest-variance-first sequencing rule and the Bailey–Welch scheduling rule are optimal. Furthermore, a case study with data from the radiology department of a large university hospital demonstrates that the approach not only guarantees acceptable waiting times but, compared with existing robust approaches, may simultaneously reduce costs incurred by idle time and overtime. Managerial implications: This work suggests that limiting instead of minimizing customer waiting times is a win–win solution in the trade-off between customer satisfaction and cost minimization. Additionally, it provides an easy-to-implement and customizable appointment scheduling framework with waiting time guarantees. Funding: This work was supported by the Deutsche Forschungsgemeinschaft [Grant 277991500/GRK2201]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.0852 .

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Bauerhenne, C., Kolisch, R., & Schulz, A. S. (2026). Robust Appointment Scheduling with Waiting Time Guarantees. Manufacturing & Service Operations Management, 28(3), 995–1009. https://doi.org/10.1287/msom.2024.0852

MLA 9

Bauerhenne, Carolin, et al. “Robust Appointment Scheduling with Waiting Time Guarantees.” Manufacturing & Service Operations Management, vol. 28, no. 3, 2026, pp. 995–1009. https://doi.org/10.1287/msom.2024.0852.

Chicago

Bauerhenne, Carolin, Rainer Kolisch, and Andreas S. Schulz. 2026. “Robust Appointment Scheduling with Waiting Time Guarantees.” Manufacturing & Service Operations Management 28 (3): 995–1009. https://doi.org/10.1287/msom.2024.0852.

Harvard

Bauerhenne, C., Kolisch, R. and Schulz, A. S. (2026) ‘Robust Appointment Scheduling with Waiting Time Guarantees’, Manufacturing & Service Operations Management, 28(3), pp. 995–1009. doi:10.1287/msom.2024.0852.

IEEE

C. Bauerhenne, R. Kolisch, and A. S. Schulz, “Robust Appointment Scheduling with Waiting Time Guarantees,” Manufacturing & Service Operations Management, vol. 28, no. 3, pp. 995–1009, 2026, doi: 10.1287/msom.2024.0852.

BibTeX

@article{bauerhenne2026robust,
  title     = {{Robust Appointment Scheduling with Waiting Time Guarantees}},
  author    = {Bauerhenne, Carolin and Kolisch, Rainer and Schulz, Andreas S.},
  journal   = {Manufacturing \& Service Operations Management},
  year      = {2026},
  volume    = {28},
  number    = {3},
  pages     = {995--1009},
  doi       = {10.1287/msom.2024.0852},
  url       = {https://doi.org/10.1287/msom.2024.0852}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Healthcare Operations and Scheduling Optimization

  • appointment scheduling
  • robust optimization
  • box uncertainty
  • service time uncertainty
  • missed appointments
  • customer satisfaction
  • mixed-integer linear programming
  • radiology scheduling

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Bauerhenne, C., Kolisch, R., & Schulz, A. S. (2026). Robust Appointment Scheduling with Waiting Time Guarantees. Manufacturing & Service Operations Management, 28(3), 995–1009. https://doi.org/10.1287/msom.2024.0852

How many times has this paper been cited?

10 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Carolin Bauerhenne, Rainer Kolisch, Andreas S. Schulz.

What is the DOI of this paper?

10.1287/msom.2024.0852, permanently at https://doi.org/10.1287/msom.2024.0852. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.