Technical Note—Asymptotically Optimal Control of Omnichannel Service Systems with Pick-up Guarantees

References

• Afeche P (2013) Incentive-compatible revenue management in queueing systems: Optimal strategic delay. Manufacturing Service Oper. Management 15(3):423–443.Link, Google Scholar
• Armony M, Maglaras C (2004) On customer contact centers with a call-back option: Customer decisions, routing rules, and system design. Oper. Res. 52(2):271–292.Link, Google Scholar
• Atar R, Giat C, Shimkin N (2010) The cμ/θ rule for many server queues with abandonment. Oper. Res. 58(5):1427–1439.Link, Google Scholar
• Baron O, Berman O, Krass D, Wang J (2014) Using strategic idleness to improve customer service experience in service networks. Oper. Res. 62(1):123–140.Link, Google Scholar
• Baron O, Berman O, Krass D, Wang J (2017) Strategic idleness and dynamic scheduling in an open-shop service network: Case study and analysis. Manufacturing Service Oper. Management 19(1):52–71.Link, Google Scholar
• Baron O, Chen X, Li Y (2023) Omnichannel services: The false premise and operational remedies. Management Sci. Forthcoming.Link, Google Scholar
• Benjaafar S, ElHafsi M, Huang T (2010) Optimal control of a production-inventory system with both backorders and lost sales. Naval Res. Logist. 57(3):252–265.Crossref, Google Scholar
• Chen M, Hu M, Wang J (2022) Food delivery service and restaurant: Friend or foe? Management Sci. 68(9):6539–6551.Link, Google Scholar
• Cox DR, Smith W (1961) Queues (Chapman & Hill/CRC, Boca Raton, FL).Google Scholar
• Dai JG, Yao D (2013) Brownian inventory models with convex holding cost, part 1: Average-optimal controls. Stochastics Systems 3(2):442–499.Link, Google Scholar
• Farahani MH, Dawande M, Janakiraman G (2022) Order now, pickup in 30 minutes: Managing queues with static delivery guarantees. Oper. Res. 70(4):2013–2031.Link, Google Scholar
• Gao X, Huang J (2023) Asymptotically optimal control of make-to-stock systems. Math. Oper. Res. Forthcoming.Google Scholar
• Heyman DP, Stidham S Jr (1980) The relation between customer and time averages in queues. Oper. Res. 28(4):983–994.Link, Google Scholar
• Markowitz DM, Wein LM (2001) Heavy traffic analysis of dynamic cyclic policies: A unified treatment of the single machine scheduling problem. Oper. Res. 49(2):246–270.Link, Google Scholar
• Serfozo R (2012) Introduction to Stochastic Networks, vol. 44 (Springer Science & Business Media, Boston).Google Scholar
• Stidham S Jr (1974) A last word on L=λW. Oper. Res. 22(2):417–421.Link, Google Scholar
• van Mieghem JA (1995) Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probability 5(3):809–833.Crossref, Google Scholar
• Wein LM (1992) Dynamic scheduling of a multiclass make-to-stock queue. Oper. Res. 40(4):724–735.Link, Google Scholar