Joint Capacity Allocation and Job Assignment Under Uncertainty

References

• Armony M, Ward AR (2010) Fair dynamic routing in large-scale heterogeneous-server systems. Oper. Res. 58(3):624–637.Link, Google Scholar
• Bandi C, Bertsimas D, Youssef N (2015) Robust queueing theory. Oper. Res. 63(3):676–700.Link, Google Scholar
• Bandi C, Loke GG, Wang P, Zhu T (2018) Prescriptive analytics for queue optimization: An optimization-based paradigm for modelling queues. Preprint, submitted June 20, https://doi.org/10.2139/ssrn.3190874.Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Bertsimas D, Sim M, Zhang M (2019) Adaptive distributionally robust optimization. Management Sci. 65(2):604–618.Link, Google Scholar
• Brown DB, Sim M (2009) Satisficing measures for analysis of risky positions. Management Sci. 55(1):71–84.Link, Google Scholar
• Chan CW, Huang M, Sarhangian V (2021) Dynamic server assignment in multiclass queues with shifts, with applications to nurse staffing in emergency departments. Oper. Res. 69(6):1936–1959.Link, Google Scholar
• Chen W, Sim M (2009) Goal-driven optimization. Oper. Res. 57(2):342–357.Link, Google Scholar
• Chen Y, Whitt W (2022) Applying optimization theory to study extremal GI/GI/1 transient mean waiting times. Queueing Systems 101(3):197–220.Crossref, Google Scholar
• Correia I, Nickel S, Saldanha-da Gama F (2018) A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities. Omega 74:122–134.Crossref, Google Scholar
• Dai JG, Meyn SP (1995) Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Trans. Automatic Control 40(11):1889–1904.Crossref, Google Scholar
• Dai JG, Shi P (2019) Inpatient overflow: An approximate dynamic programming approach. Manufacturing Service Oper. Management 21(4):894–911.Link, Google Scholar
• Ghosh S, Varakantham P, Adulyasak Y, Jaillet P (2017) Dynamic repositioning to reduce lost demand in bike sharing systems. J. Artificial Intelligence Res. 58:387–430.Crossref, Google Scholar
• Gotoh JY, Kim MJ, Lim AEB (2021) Calibration of distributionally robust empirical optimization models. Oper. Res. 69(5):1630–1650.Link, Google Scholar
• Gupta D, Wang L (2008) Revenue management for a primary-care clinic in the presence of patient choice. Oper. Res. 56(3):576–592.Link, Google Scholar
• Hall NG, Long DZ, Qi J, Sim M (2015) Managing underperformance risk in project portfolio selection. Oper. Res. 63(3):660–675.Link, Google Scholar
• He S, Sim M, Zhang M (2019) Data-driven patient scheduling in emergency departments: A hybrid robust-stochastic approach. Management Sci. 65(9):4123–4140.Link, Google Scholar
• Jaillet P, Lu X (2014) Online stochastic matching: New algorithms with better bounds. Math. Oper. Res. 39(3):624–646.Link, Google Scholar
• Jaillet P, Goei Loke G, Sim M (2022a) Strategic workforce planning under uncertainty. Oper. Res. 70(2):1042–1065.Link, Google Scholar
• Jaillet P, Qi J, Sim M (2016) Routing optimization under uncertainty. Oper. Res. 64(1):186–200.Link, Google Scholar
• Jaillet P, Dominik Jena S, Ng TS, Sim M (2022b) Satisficing models under uncertainty. INFORMS J. Optim. 4(4):347–372.Link, Google Scholar
• Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Ortiz H, ed. Proc. 22nd Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 352–358.Google Scholar
• Lam SW, Ng TS, Sim M, Song JH (2013) Multiple objectives satisficing under uncertainty. Oper. Res. 61(1):214–227.Link, Google Scholar
• Long DZ, Sim M, Zhou M (2023) Robust satisficing. Oper. Res. 71(1):61–82.Link, Google Scholar
• Lyu G, Cheung WC, Teo CP, Wang H (2019) Multi-objective online ride-matching. Preprint, submitted April 17, https://doi.org/10.2139/ssrn.3356823.Google Scholar
• Martonosi SE (2011) Dynamic server allocation at parallel queues. IIE Trans. 43(12):863–877.Crossref, Google Scholar
• Mohajerin Esfahani P, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Programming 171:115–166.Crossref, Google Scholar
• Nemirovski A, Shapiro A (2007) Convex approximations of chance constrained programs. SIAM J. Optim. 17(4):969–996.Crossref, Google Scholar
• Özkan E, Ward AR (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.Link, Google Scholar
• Pines JM, Batt RJ, Hilton JA, Terwiesch C (2011) The financial consequences of lost demand and reducing boarding in hospital emergency departments. Ann. Emergency Medicine 58(4):331–340.Crossref, Google Scholar
• Puha AL, Ward AR (2019) Scheduling an overloaded multiclass many-server queue with impatient customers. Netessine S, ed. Operations Research & Management Science in the Age of Analytics, INFORMS TutORials in Operations Research (INFORMS, Catonsville, MD), 189–217.Link, Google Scholar
• Qi W, Li L, Liu S, Shen ZJM (2018) Shared mobility for last-mile delivery: Design, operational prescriptions, and environmental impact. Manufacturing Service Oper. Management 20(4):737–751.Link, Google Scholar
• Rabin E, Kocher K, McClelland M, Pines J, Hwang U, Rathlev N, Asplin B, Trueger NS, Weber E (2012) Solutions to emergency department “boarding” and crowding are underused and may need to be legislated. Health Affairs 31(8):1757–1766.Crossref, Google Scholar
• Reeves GR, Sweigart JR (1982) Multiperiod resource allocation with variable technology. Management Sci. 28(12):1441–1449.Link, Google Scholar
• Riedel M (1999) Online matching for scheduling problems. Meinel C, Tison S, eds. STACS 99: Proc. 16th Sympos. Theoretical Aspects Comput. Sci., Lecture Notes in Computer Science, vol. 1563 (Springer, Berlin, Heidelberg), 571–580.Google Scholar
• Shu J, Chou MC, Liu Q, Teo CP, Wang IL (2013) Models for effective deployment and redistribution of bicycles within public bicycle-sharing systems. Oper. Res. 61(6):1346–1359.Link, Google Scholar
• Singer AJ, Thode HC Jr, Viccellio P, Pines JM (2011) The association between length of emergency department boarding and mortality. Acad. Emergency Medicine 18(12):1324–1329.Crossref, Google Scholar
• Spivey MZ, Powell WB (2004) The dynamic assignment problem. Transportation Sci. 38(4):399–419.Link, Google Scholar
• van Eekelen W, van Leeuwaarden JS (2022) Distributionally robust views on extremal queues. Queueing Systems 100(3):485–487.Crossref, Google Scholar
• Whitt W (2005) Two fluid approximations for multi-server queues with abandonments. Oper. Res. Lett. 33(4):363–372.Crossref, Google Scholar
• Xie J, Fan Y, Chou MC (2017) Flexibility design in loss and queueing systems: Efficiency of k-chain configuration. Flexible Services Manufacturing J. 29:286–308.Crossref, Google Scholar
• Xie J, Loke GG, Sim M, Lam SW (2023) The analytics of bed shortages: Coherent metric, prediction, and optimization. Oper. Res. 71(1):23–46.Link, Google Scholar
• Zeng Y, Zhang L, Cai X, Li J (2018) Cost sharing for capacity transfer in cooperating queueing systems. Production Oper. Management 27(4):644–662.Crossref, Google Scholar
• Zhang J (2013) Fluid models of many-server queues with abandonment. Queueing Systems 73(2):147–193.Crossref, Google Scholar
• Zhou M, Loke GG, Bandi C, Liau ZQG, Wang W (2022) Intraday scheduling with patient re-entries and variability in behaviours. Manufacturing Service Oper. Management 24(1):561–579.Link, Google Scholar
• Zhu T, Yeo NTB, Gao SY, Loke GG (2023) Inventory-responsive donor-management policy: A tandem queueing network model. Manufacturing Service Oper. Management 25(4):1585–1602.Link, Google Scholar