The Anchor-Robust Project Scheduling Problem

References

• Ayoub J, Poss M (2016) Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Comput. Management Sci. 13(2):219–239. 10.1007/s10287-016-0249-2.Crossref, Google Scholar
• Bendotti P, Chrétienne P, Fouilhoux P, Quilliot A (2017) Anchored reactive and proactive solutions to the CPM-scheduling problem. Eur. J. Oper. Res. 261(1):67–74. 10.1016/j.ejor.2017.02.007.Crossref, Google Scholar
• Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376. 10.1007/s10107-003-0454-y.Crossref, Google Scholar
• Bertsimas D, Caramanis C (2010) Finite adaptability in multistage linear optimization. IEEE Trans. Automatic Control 55(12):2751–2766. 10.1109/TAC.2010.2049764.Crossref, Google Scholar
• Bertsimas D, Goyal V (2012) On the power and limitations of affine policies in two-stage adaptive optimization. Math. Programming 134(2):491–531. 10.1007/s10107-011-0444-4.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53. 10.1287/opre.1030.0065.Link, Google Scholar
• Billionnet A, Costa M-C, Poirion P-L (2014) 2-stage robust MILP with continuous recourse variables. Discrete Appl. Math. 170:21–32.Crossref, Google Scholar
• Boros E, Borys K, Elbassioni KM, Gurvich V, Rudolf G (2006) Inapproximability bounds for shortest-path network interdiction problems. Technical report, Rutgers University, New Brunswick, NJ.Google Scholar
• Bougeret M, Pessoa AA, Poss M (2019) Robust scheduling with budgeted uncertainty. Discrete Appl. Math. 261:93–107. 10.1016/j.dam.2018.07.001.Crossref, Google Scholar
• Bruni M, Luigi DPP, Beraldi P, Guerriero F (2016) An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations. Omega 71:66–84.Crossref, Google Scholar
• Bruni ME, Di Puglia Pugliese L, Beraldi P, Guerriero F (2018) A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem. Comput. Oper. Res. 99:178–190.Crossref, Google Scholar
• Büsing C (2012) Recoverable robust shortest path problems. Networks 59(1):181–189.Crossref, Google Scholar
• D’Angelo G, Di Stefano G, Navarra A, Pinotti C (2011) Recoverable robust timetables: An algorithmic approach on trees. IEEE Trans. Comput. 60:433–446. 10.1109/TC.2010.142.Crossref, Google Scholar
• El Housni O, Goyal V (2021) On the optimality of affine policies for budgeted uncertainty sets. Math. Oper. Res. 46(2):674–711. 10.1287/moor.2020.1082.Link, Google Scholar
• Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman and Co., New York).Google Scholar
• Herroelen W, Leus R (2002) Project scheduling under uncertainty: Survey and research potentials. Eur. J. Oper. Res. 165(2):289–306.Crossref, Google Scholar
• Herroelen W, Leus R (2004) The construction of stable project baseline schedules. Eur. J. Oper. Res. 156(3):550–565. 10.1016/S0377-2217(03)00130-9Crossref, Google Scholar
• Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2):97–111.Crossref, Google Scholar
• Kasperski A, Zieliński P (2016) Robust Discrete Optimization Under Discrete and Interval Uncertainty: A Survey (Springer International Publishing, Cham, Switzerland), 113–143.Crossref, Google Scholar
• Kolisch R, Sprecher A (1996) PSPLIB—a project scheduling problem library. Eur. J. Oper. Res. 96(1):205–216.Crossref, Google Scholar
• Liebchen C, Lübbecke M, Möhring R, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. Ahuja RK, Möhring RH, Zaroliagis CD, eds. Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science, vol. 5868 (Springer, Berlin), 1–27.Crossref, Google Scholar
• Minoux M (2007a) Models and algorithms for robust PERT scheduling with time-dependent task durations. Vietnam J. Math. 35(4):387–398.Google Scholar
• Minoux M (2007b) Duality, Robustness, and 2-stage robust LP decision models. Application to Robust PERT Scheduling. Working paper. https://hal.archives-ouvertes.fr/hal-00180529.Google Scholar
• Pinedo ML (2002) Scheduling: Theory, Algorithms, and Systems, 4th ed. (Springer, Boston).Google Scholar
• Schrijver A (2003) Combinatorial Optimization—Polyhedra and Efficiency (Springer-Verlag, Berlin).Google Scholar
• Soyster AL (1973) Technical note—Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5):1154–1157. 10.1287/opre.21.5.1154.Link, Google Scholar
• Valdes J, Tarjan RE, Lawler EL (1982) The recognition of series parallel digraphs. SIAM J. Comput. 11(2):298–313.Crossref, Google Scholar
• Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5):457–461. 10.1016/j.orl.2013.05.003.Crossref, Google Scholar