Integer programming approaches for appointment scheduling with random no-shows and service durations

Ruiwei Jiang, Siqian Shen, Yiling Zhang

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

We consider a single-server scheduling problem given a fixed sequence of appointment arrivals with random no-shows and service durations. The probability distribution of the uncertain parameters is assumed to be ambiguous, and only the support and first moments are known. We formulate a class of distributionally robust (DR) optimization models that incorporate the worst-case expectation/conditional value-at-risk penalty cost of appointment waiting, server idleness, and overtime into the objective or constraints. Our models flexibly adapt to di erent prior beliefs of no-show uncertainty. We obtain exact mixed-integer nonlinear programming reformulations and derive valid inequalities to strengthen the reformulations that are solved by decomposition algorithms. In particular, we derive convex hulls for special cases of no-show beliefs, yielding polynomial-sized linear programming models for the least and the most conservative supports of no-shows. We test various instances to demonstrate the computational e cacy of our approaches and to compare the results of various DR models given perfect or ambiguous distributional information.

Original languageEnglish (US)
Pages (from-to)1638-1656
Number of pages19
JournalOperations Research
Volume65
Issue number6
DOIs
StatePublished - Nov 1 2017
Externally publishedYes

Fingerprint

Integer programming
Scheduling
Servers
Nonlinear programming
Linear programming
Probability distributions
Polynomials
Decomposition
Appointment scheduling
Costs

Keywords

  • Appointment scheduling
  • Convex hulls
  • Distributionally robust optimization
  • Mixed-integer programming
  • No-show uncertainty
  • Totally unimodularity
  • Valid inequalities

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research

Cite this

Integer programming approaches for appointment scheduling with random no-shows and service durations. / Jiang, Ruiwei; Shen, Siqian; Zhang, Yiling.

In: Operations Research, Vol. 65, No. 6, 01.11.2017, p. 1638-1656.

Research output: Contribution to journalArticle

@article{1a68e3b71d3f49b98ae5bd3951aa465b,
title = "Integer programming approaches for appointment scheduling with random no-shows and service durations",
abstract = "We consider a single-server scheduling problem given a fixed sequence of appointment arrivals with random no-shows and service durations. The probability distribution of the uncertain parameters is assumed to be ambiguous, and only the support and first moments are known. We formulate a class of distributionally robust (DR) optimization models that incorporate the worst-case expectation/conditional value-at-risk penalty cost of appointment waiting, server idleness, and overtime into the objective or constraints. Our models flexibly adapt to di erent prior beliefs of no-show uncertainty. We obtain exact mixed-integer nonlinear programming reformulations and derive valid inequalities to strengthen the reformulations that are solved by decomposition algorithms. In particular, we derive convex hulls for special cases of no-show beliefs, yielding polynomial-sized linear programming models for the least and the most conservative supports of no-shows. We test various instances to demonstrate the computational e cacy of our approaches and to compare the results of various DR models given perfect or ambiguous distributional information.",
keywords = "Appointment scheduling, Convex hulls, Distributionally robust optimization, Mixed-integer programming, No-show uncertainty, Totally unimodularity, Valid inequalities",
author = "Ruiwei Jiang and Siqian Shen and Yiling Zhang",
year = "2017",
month = "11",
day = "1",
doi = "10.1287/opre.2017.1656",
language = "English (US)",
volume = "65",
pages = "1638--1656",
journal = "Operations Research",
issn = "0030-364X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "6",

}

TY - JOUR

T1 - Integer programming approaches for appointment scheduling with random no-shows and service durations

AU - Jiang, Ruiwei

AU - Shen, Siqian

AU - Zhang, Yiling

PY - 2017/11/1

Y1 - 2017/11/1

N2 - We consider a single-server scheduling problem given a fixed sequence of appointment arrivals with random no-shows and service durations. The probability distribution of the uncertain parameters is assumed to be ambiguous, and only the support and first moments are known. We formulate a class of distributionally robust (DR) optimization models that incorporate the worst-case expectation/conditional value-at-risk penalty cost of appointment waiting, server idleness, and overtime into the objective or constraints. Our models flexibly adapt to di erent prior beliefs of no-show uncertainty. We obtain exact mixed-integer nonlinear programming reformulations and derive valid inequalities to strengthen the reformulations that are solved by decomposition algorithms. In particular, we derive convex hulls for special cases of no-show beliefs, yielding polynomial-sized linear programming models for the least and the most conservative supports of no-shows. We test various instances to demonstrate the computational e cacy of our approaches and to compare the results of various DR models given perfect or ambiguous distributional information.

AB - We consider a single-server scheduling problem given a fixed sequence of appointment arrivals with random no-shows and service durations. The probability distribution of the uncertain parameters is assumed to be ambiguous, and only the support and first moments are known. We formulate a class of distributionally robust (DR) optimization models that incorporate the worst-case expectation/conditional value-at-risk penalty cost of appointment waiting, server idleness, and overtime into the objective or constraints. Our models flexibly adapt to di erent prior beliefs of no-show uncertainty. We obtain exact mixed-integer nonlinear programming reformulations and derive valid inequalities to strengthen the reformulations that are solved by decomposition algorithms. In particular, we derive convex hulls for special cases of no-show beliefs, yielding polynomial-sized linear programming models for the least and the most conservative supports of no-shows. We test various instances to demonstrate the computational e cacy of our approaches and to compare the results of various DR models given perfect or ambiguous distributional information.

KW - Appointment scheduling

KW - Convex hulls

KW - Distributionally robust optimization

KW - Mixed-integer programming

KW - No-show uncertainty

KW - Totally unimodularity

KW - Valid inequalities

UR - http://www.scopus.com/inward/record.url?scp=85034614753&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034614753&partnerID=8YFLogxK

U2 - 10.1287/opre.2017.1656

DO - 10.1287/opre.2017.1656

M3 - Article

AN - SCOPUS:85034614753

VL - 65

SP - 1638

EP - 1656

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 6

ER -