Order Ahead for Pickup: Promise or Peril?

Problem definition: Mobile technologies have increasingly enabled remote customers to order ahead at quick-service restaurants. As customers travel to the service facility to pick up their orders, their orders also advance in the food preparation queue. It is widely believed that the ability to order ahead reduces customers’ total delay and, therefore, allows restaurants to attract more orders and achieve higher throughput than if customers must order onsite. Methodology/results: We build a queueing game–theoretic model to study a mixed ordering scheme in which some customers order ahead and some order on-site. Our analysis shows that the common practice of accepting all orders as they come in and requiring all orders to be irrevocable can cause a mixed ordering scheme to surprisingly achieve lower throughput than an on-site–only ordering scheme. The throughput shortfall can persist even when the service provider freely chooses whether to share queue-length information with remote customers. However, if remote customers who order ahead are allowed to cancel unprepared orders when they arrive at the service facility, then such a mixed ordering scheme with cancellation achieves higher throughput than the on-site–only ordering scheme even though it does not uniformly dominate the original mixed ordering scheme (without cancellations). We then study a capped ordering scheme in which the service provider stops accepting new remote orders if the number of outstanding orders reaches a certain threshold. When the service provider optimally sets the cap, the mixed–capped ordering scheme outperforms both the mixed ordering scheme without capping and the on-site–only ordering scheme in throughput but not necessarily the cancellation scheme. Finally, we propose an optimal mechanism in which the service provider determines both the capping and cancellation thresholds subject to customers’ individual rationality constraints. Managerial implications: Our paper highlights the unintended consequences of ordering ahead and provides prescriptive guidance for managing such a service system. Funding: The work of K. Sun was supported by the Beijing Natural Science Foundation, China [Grant 9244031]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.0865 .

Authors

Institutions

Publication Details

Journal
Manufacturing & Service Operations Management
Published
2026-02-18
DOI
https://doi.org/10.1287/msom.2024.0865
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Order Ahead for Pickup: Promise or Peril?

Ke Sun, Luyi Yang, Yunan Liu
Manufacturing & Service Operations Management
Advanced Queuing Theory Analysis
article

Order Ahead for Pickup: Promise or Peril?

Ke Sun, Luyi Yang, Yunan Liu
article en

Abstract

Problem definition: Mobile technologies have increasingly enabled remote customers to order ahead at quick-service restaurants. As customers travel to the service facility to pick up their orders, their orders also advance in the food preparation queue. It is widely believed that the ability to order ahead reduces customers’ total delay and, therefore, allows restaurants to attract more orders and achieve higher throughput than if customers must order onsite. Methodology/results: We build a queueing game–theoretic model to study a mixed ordering scheme in which some customers order ahead and some order on-site. Our analysis shows that the common practice of accepting all orders as they come in and requiring all orders to be irrevocable can cause a mixed ordering scheme to surprisingly achieve lower throughput than an on-site–only ordering scheme. The throughput shortfall can persist even when the service provider freely chooses whether to share queue-length information with remote customers. However, if remote customers who order ahead are allowed to cancel unprepared orders when they arrive at the service facility, then such a mixed ordering scheme with cancellation achieves higher throughput than the on-site–only ordering scheme even though it does not uniformly dominate the original mixed ordering scheme (without cancellations). We then study a capped ordering scheme in which the service provider stops accepting new remote orders if the number of outstanding orders reaches a certain threshold. When the service provider optimally sets the cap, the mixed–capped ordering scheme outperforms both the mixed ordering scheme without capping and the on-site–only ordering scheme in throughput but not necessarily the cancellation scheme. Finally, we propose an optimal mechanism in which the service provider determines both the capping and cancellation thresholds subject to customers’ individual rationality constraints. Managerial implications: Our paper highlights the unintended consequences of ordering ahead and provides prescriptive guidance for managing such a service system. Funding: The work of K. Sun was supported by the Beijing Natural Science Foundation, China [Grant 9244031]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.0865 .

Manufacturing & Service Operations Management
North Carolina State University (US), McGill University (CA), University of California, Berkeley (US)
Openalex Percentile: Top 58%
Advanced Queuing Theory Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.