IDEAS home Printed from https://ideas.repec.org/p/mag/wpaper/23001.html

Optimal Service Time Windows

Author

Listed:
  • Marlin W. Ulmer
  • Justin C. Goodson
  • Barrett W. Thomas

Abstract

Because customers must usually arrange their schedules to be present for home services, they desire an accurate estimate of when the service will take place. However, even when firms quote large service time windows, they are often missed, leading to customer dissatisfaction. Wide time windows and frequent failures occur because time windows must be communicated to customers in the face of several uncertainties: future customer requests are unknown, final service plans are not yet determined, and when fulfillment is outsourced to a third party, the firm has limited control over routing procedures. Even when routing is performed in-house, time windows typically do not receive explicit consideration. In this paper, we show how companies can communicate reliable and narrow time windows to customers in the face of arrival time uncertainty. Under mild assumptions, our main result characterizes the optimal policy, identifying structure that reduces a high-dimensional stochastic non-linear optimization problem to a root-finding problem in one dimension. The result inspires a practice-ready heuristic for the more general case. Relative to the industry standard of communicating uniform time windows to all customers, and to other policies applied in practice, our method of quoting customer-specific time windows yields a substantial increase in customer convenience without sacrificing reliability of service, providing results that nearly achieve the lower bound on the optimal solution. Our results show that (i) time windows should be tailored to individual customers, (ii) time window sizes should be proportional to the service level, (iii) larger time windows should be assigned to earlier requests and smaller time windows to later requests, (iv) larger time windows should be assigned to customers further from the depot of operation and smaller time windows to closer customers, and (v) two time windows for one customer are helpful in some cases.

Suggested Citation

  • Marlin W. Ulmer & Justin C. Goodson & Barrett W. Thomas, 2023. "Optimal Service Time Windows," FEMM Working Papers 23001, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
  • Handle: RePEc:mag:wpaper:23001
    as

    Download full text from publisher

    File URL: https://www.fww.ovgu.de/fww_media/femm/femm_2023/2023_01.pdf
    File Function: First version, 2011
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Martins, Sara & Ostermeier, Manuel & Amorim, Pedro & Hübner, Alexander & Almada-Lobo, Bernardo, 2019. "Product-oriented time window assignment for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 893-909.
    2. Subramanyam, Anirudh & Wang, Akang & Gounaris, Chrysanthos E., 2018. "A scenario decomposition algorithm for strategic time window assignment vehicle routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 296-317.
    3. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2005. "Decision Support for Consumer Direct Grocery Initiatives," Transportation Science, INFORMS, vol. 39(3), pages 313-327, August.
    4. Visser, T.R. & Savelsbergh, M.W.P., 2019. "Strategic Time Slot Management: A Priori Routing for Online Grocery Retailing," Econometric Institute Research Papers EI2019-04, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    5. Wassmuth, K. & Köhler, C. & Agatz, N.A.H. & Fleischmann, M., 2022. "Demand Management for Attended Home Delivery – A Literature Review," ERIM Report Series Research in Management ERS-2022-002-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    6. Niels Agatz & Yingjie Fan & Daan Stam, 2021. "The Impact of Green Labels on Time Slot Choice and Operational Sustainability," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2285-2303, July.
    7. Ehmke, Jan Fabian & Campbell, Ann Melissa, 2014. "Customer acceptance mechanisms for home deliveries in metropolitan areas," European Journal of Operational Research, Elsevier, vol. 233(1), pages 193-207.
    8. Remy Spliet & Said Dabia & Tom Van Woensel, 2018. "The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times," Transportation Science, INFORMS, vol. 52(2), pages 261-276, March.
    9. Zhang, Zhenzhen & Liu, Mengyang & Lim, Andrew, 2015. "A memetic algorithm for the patient transportation problem," Omega, Elsevier, vol. 54(C), pages 60-71.
    10. Gökçe Kahveciog̃lu & Barış Balcıog̃lu, 2016. "Coping with production time variability via dynamic lead-time quotation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 877-898, October.
    11. Neves-Moreira, Fábio & Pereira da Silva, Diogo & Guimarães, Luís & Amorim, Pedro & Almada-Lobo, Bernardo, 2018. "The time window assignment vehicle routing problem with product dependent deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 163-183.
    12. Anastasios D. Vareias & Panagiotis P. Repoussis & Panagiotis P. Repoussi, 2019. "Assessing Customer Service Reliability in Route Planning with Self-Imposed Time Windows and Stochastic Travel Times," Service Science, INFORMS, vol. 53(1), pages 256-281, February.
    13. Remy Spliet & Adriana F. Gabor, 2015. "The Time Window Assignment Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 721-731, November.
    14. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2016. "Price and Lead Time Quotation for Contract and Spot Customers," Operations Research, INFORMS, vol. 64(2), pages 406-415, April.
    15. Spliet, Remy & Desaulniers, Guy, 2015. "The discrete time window assignment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 379-391.
    16. Mark L. Spearman & Rachel Q. Zhang, 1999. "Optimal Lead Time Policies," Management Science, INFORMS, vol. 45(2), pages 290-295, February.
    17. Maaike Hoogeboom & Yossiri Adulyasak & Wout Dullaert & Patrick Jaillet, 2021. "The Robust Vehicle Routing Problem with Time Window Assignments," Transportation Science, INFORMS, vol. 55(2), pages 395-413, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marlin W. Ulmer & Justin C. Goodson & Barrett W. Thomas, 2024. "Optimal Service Time Windows," Transportation Science, INFORMS, vol. 58(2), pages 394-411, March.
    2. Jean-François Cordeau & Manuel Iori & Dario Vezzali, 2024. "An updated survey of attended home delivery and service problems with a focus on applications," Annals of Operations Research, Springer, vol. 343(2), pages 885-922, December.
    3. Côté, Jean-François & Mansini, Renata & Raffaele, Alice, 2024. "Multi-period time window assignment for attended home delivery," European Journal of Operational Research, Elsevier, vol. 316(1), pages 295-309.
    4. Paradiso, Rosario & Roberti, Roberto & Ulmer, Marlin, 2025. "Lookahead scenario relaxation for dynamic time window assignment in service routing," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    5. Çelik, Sifa & Schrotenboer, Albert H. & Martin, Layla & Van Woensel, Tom, 2026. "Is waiting worth it? the value of delaying time window assignment in vehicle routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 204(C).
    6. Waßmuth, Katrin & Köhler, Charlotte & Agatz, Niels & Fleischmann, Moritz, 2023. "Demand management for attended home delivery—A literature review," European Journal of Operational Research, Elsevier, vol. 311(3), pages 801-815.
    7. Jean-François Cordeau & Manuel Iori & Dario Vezzali, 2023. "A survey of attended home delivery and service problems with a focus on applications," 4OR, Springer, vol. 21(4), pages 547-583, December.
    8. Cavaliere, Francesco & Fischetti, Matteo & Roberti, Roberto & Salvagnin, Domenico, 2026. "Models and algorithms for the Time Window Assignment Traveling Salesperson Problem with stochastic travel times," European Journal of Operational Research, Elsevier, vol. 329(1), pages 96-111.
    9. Charlotte Ackva & Marlin W. Ulmer, 2024. "Consistent routing for local same-day delivery via micro-hubs," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(2), pages 375-409, June.
    10. Shohre Zehtabian & Marlin W. Ulmer, 2023. "Consistent Time Window Assignments for Stochastic Multi-Depot Multi-Commodity Pickup and Delivery," FEMM Working Papers 23002, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    11. Ruidian Song & Hoong Chuin Lau & Xue Luo & Lei Zhao, 2022. "Coordinated Delivery to Shopping Malls with Limited Docking Capacity," Transportation Science, INFORMS, vol. 56(2), pages 501-527, March.
    12. Marlin W. Ulmer & Barrett W. Thomas, 2019. "Enough Waiting for the Cable Guy—Estimating Arrival Times for Service Vehicle Routing," Transportation Science, INFORMS, vol. 53(3), pages 897-916, May.
    13. Bonomi, Valentina & Manerba, Daniele & Mansini, Renata & Zanotti, Roberto, 2025. "Optimizing Attended Home Delivery: Multiple recovery options and customer availability profiles to face synchronization failures," International Journal of Production Economics, Elsevier, vol. 279(C).
    14. Koch, Sebastian & Klein, Robert, 2020. "Route-based approximate dynamic programming for dynamic pricing in attended home delivery," European Journal of Operational Research, Elsevier, vol. 287(2), pages 633-652.
    15. Hosseini, Seyede-Saeede & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2026. "Consistent home health care routing and scheduling problem under time uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
    16. Şifa Çelik & Layla Martin & Albert H. Schrotenboer & Tom Van Woensel, 2025. "Exact Two-Step Benders Decomposition for the Time Window Assignment Traveling Salesperson Problem," Transportation Science, INFORMS, vol. 59(2), pages 210-228, March.
    17. Nils Boysen & Stefan Fedtke & Stefan Schwerdfeger, 2021. "Last-mile delivery concepts: a survey from an operational research perspective," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 1-58, March.
    18. 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.
    19. Kevin Dalmeijer & Guy Desaulniers, 2021. "Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 495-510, May.
    20. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mag:wpaper:23001. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: IT Administrators at FWW (email available below). General contact details of provider: https://edirc.repec.org/data/fwmagde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.