Buffer Times Between Scheduled Events in Resource Assignment Problem: A Conflict-Robust Perspective

Published Online:https://doi.org/10.1287/msom.2022.0572

References

  • Bandi C, Bertsimas D (2012) Tractable stochastic analysis in high dimensions via robust optimization. Math. Programming 134(1):23–70.CrossrefGoogle Scholar
  • Bandi C, Bertsimas D, Youssef N (2015) Robust queueing theory. Oper. Res. 63(3):676–700.LinkGoogle Scholar
  • Bertsimas D, Kallus N (2020) From predictive to prescriptive analytics. Management Sci. 66(3):1025–1044.LinkGoogle Scholar
  • Diepen G, van den Akker J, Hoogeveen J (2009) Integrated gate and bus assignment at amsterdam airport schiphol. Robust Online Large-Scale Optim. Lecture Notes Comput. Sci. 5868:338–353.CrossrefGoogle Scholar
  • Diepen G, van den Akker J, Hoogeveen J, Smeltink J (2012) Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol. J. Scheduling 15(6):703–715.CrossrefGoogle Scholar
  • Nutz M, Wang R (2022) The directional optimal transport. Ann. Appl. Probability 32(2):1400–1420.CrossrefGoogle Scholar
  • Xiong H, Shi S, Ren D, Hu J (2022) A survey of job shop scheduling problem: The types and models. Comput. Oper. Res. 142:105731.CrossrefGoogle Scholar
  • Yan C, Kung J (2018) Robust aircraft routing. Transportation Sci. 52(1):118–133.LinkGoogle Scholar
  • Zhu S, Fan W, Yang S, Pei J, Pardalos P (2019) Operating room planning and surgical case scheduling: a review of literature. J. Combinatorial Optim. 37:757–805.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.