Managing Appointment Booking Under Customer Choices

  title={Managing Appointment Booking Under Customer Choices},
  author={Nan Liu and Peter van de Ven and Bo Zhang},
  journal={Manag. Sci.},
Motivated by the increasing use of online appointment booking platforms, we study how to offer appointment slots to customers to maximize the total number of slots booked. We develop two models, nonsequential offering and sequential offering, to capture different types of interactions between customers and the scheduling system. In these two models, the scheduler offers either a single set of appointment slots for the arriving customer to choose from or multiple sets in sequence, respectively… 
Simultaneous Customer Interaction in Online Booking Systems for Attended Home Delivery
It is argued that state-of- the-art procedures are not yet equipped to deal with the occurrence of multiple customers simultaneously interact with a booking system and present new approaches for this purpose.
Dynamic Resource Allocation in a Hierarchical Appointment System: Optimal Structure and Heuristics
A more effective method that optimizes the allocation of GH resources between referrals and nonreferrals is proposed and a heuristic policy is designed that allows referrals to acquire resources earlier in time.
Multi-Stage and Multi-Customer Assortment Optimization With Inventory Constraints
This work considers an assortment optimization problem where a customer chooses a single item from a sequence of sets shown to her, while limited inventories constrain the items offered to customers over time, and derives a polynomial-time approximation algorithm which earns at least 1-ln(2-1/e), or 0.51, of the optimum.
Assortment Optimization under the Multinomial Logit Model with Sequential Offerings
We consider assortment optimization problems, where the choice process of a customer takes place in multiple stages. There is a finite number of stages. In each stage, we offer an assortment of
Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees
The shift in the restaurant industry toward digital ordering argues for major changes in how orders are managed. The main difficulty in managing queues in online food-ordering services arises from
A Sequential Recommendation and Selection Model
We propose a sequential recommendation-selection model where a seller recommends sets of products to consumers over multiple stages. consumers are heterogeneous in the patience levels, characterized
Dynamic Inter-day and Intra-day Scheduling
The first analytical model and optimization framework to address this joint problem effectively and efficiently and derive theoretical upper and lower bounds for the joint problem is provided, based on which a heuristic solution with a theoretically guaranteed optimality gap is developed.
Physician Recommendation on Healthcare Appointment Platforms Considering Patient Choice
This work considers not only the influence of physician assortment to patient choice but also how physicians in the assortment are displayed on the webpage, i.e., the order of physicians, to recommend personalized physician rankings in dynamic environments with limited resources.
Coordinated and Priority-based Surgical Care: An Integrated Distributionally Robust Stochastic Optimization Approach
An Integrated Multi-stage Stochastic and Distributionally Robust Optimization (IMSDRO) approach to determine the optimal clinic and surgery dates for patients such that the access target constraints are satisfied, and the clinical and surgical overtimes are minimized.
Online contextual learning with perishable resources allocation
This work proposes the first online algorithm for contextual learning and resource allocation with perishable resources and proves that the algorithm achieves an expected regret per period that increases sub-linearly with the number of planning cycles.


Appointment Scheduling Under Patient Preference and No-Show Behavior
This work develops appointment scheduling models that take into account the patient preferences regarding when they would like to be seen and proposes a heuristic solution procedure to maximize the expected net “profit” per day.
Online Resource Allocation with Customer Choice
Online algorithms that are asymptotically optimal and achieve the best constant relative performance guarantees for this class of problems are derived.
Dynamic Scheduling of Outpatient Appointments Under Patient No-Shows and Cancellations
It is found that the open access policy, a recently proposed popular scheduling paradigm that calls for “meeting today's demand today,” can be a reasonable choice when the patient load is relatively low.
Adaptive Appointment Systems with Patient Preferences
A framework for the design of the next generation of appointment systems that dynamically learn and update patients' preferences and use this information to improve booking decisions is described.
Revenue Management Under a General Discrete Choice Model of Consumer Behavior
This paper analyses a single-leg reserve management problem in which the buyers' choice behavior is modeled explicitly and develops an estimation procedure based on the expectation-maximization (EM) method that jointly estimates arrival rates and choice model parameters when no-purchase outcomes are unobservable.
Dynamic Assortment Customization with Limited Inventories
It is proved that it is optimal to follow a threshold policy under which a product is offered to a customer segment if its inventory level is higher than a threshold value, and suggested that assortment customization can be used as another lever for revenue maximization in addition to pricing.
Airline Yield Management with Overbooking, Cancellations, and No-Shows
A Markov decision process (dynamic programming) model for airline seat allocation on a single-leg flight with multiple fare classes, which exploits the equivalence to a problem in the optimal control of admission to a queueing system, which has been well studied in the queueing-control literature.
Dynamic Assignment of Flexible Service Resources
This work addresses the dynamic job acceptance and resource assignment problem for systems with general resource flexibility structure, i.e., with multiple resource types that can each perform different overlapping subsets of job types and develops and test three optimization-based approximate policies.
Revenue Management for a Primary-Care Clinic in the Presence of Patient Choice
A Markov decision process model is developed for the appointment-booking problem in which the patients' choice behavior is modeled explicitly and it is proved that the optimal policy is a threshold-type policy as long as the choice probabilities satisfy a weak condition.
Asymptotic Behavior of an Allocation Policy for Revenue Management
The primary results state that, within a stochastic and dynamic framework, solutions arising out of a single well-known linear program can be used to generate allocation policies for which the normalized revenue converges in distribution to a constant upper bound on the optimal value.