A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management

References

• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Alvras D, Padberg MW (2001) Linear Optimization and Extensions: Problems and Soluzions (Springer-Verlag, Berlin).Crossref, Google Scholar
• Balas E (1969) Machine sequencing via disjunctive graphs. Oper. Res. 17(6):941–957.Link, Google Scholar
• Balas E (1975) Facets of the knapsack polytope. Math. Programming 8(1):146–164.Crossref, Google Scholar
• Balas E (1979) Disjunctive programming. Ann. Discrete Math. 5:3–51.Crossref, Google Scholar
• Bennell JA, Mesgarpour M, Potts CN (2011) Airport runway scheduling. 4OR 9(2):115–138.Crossref, Google Scholar
• Bertsimas D, Tsitsiklis J (1997) Introduction to Linear Optimization, vol. 6 (Athena Scientific, Belmont, MA).Google Scholar
• Bonami P, Lodi A, Tramontani A, Wiese S (2015) On mathematical programming with indicator constraints. Math. Programming 151(1):191–223.Crossref, Google Scholar
• Cacchiani V, Huisman D, Kidd M, Kroon L, Toth P, Veelenturf L, Wagenaar J (2014) An overview of recovery models and algorithms for real-time railway rescheduling. Transportation Res. Part B: Methodological 63:15–37.Crossref, Google Scholar
• Cacchiani V, Toth P (2012) Nominal and robust train timetabling problems. Eur. J. Oper. Res. 219(3):727–737.Crossref, Google Scholar
• Codato G, Fischetti M (2006) Combinatorial Benders’ cuts for mixed-integer linear programming. Oper. Res. 54(4):756–766.Link, Google Scholar
• Corman F, Meng L (2015) A review of online dynamic models and algorithms for railway traffic management. IEEE Trans. Intell. Transportation Systems 16(3):1274–1284.Crossref, Google Scholar
• Desaulniers G, Desrosiers J, Solomon MM, eds. (2006) Column Generation, vol. 5 (Springer Science & Business Media, New York).Google Scholar
• Dyer M, Wolsey L (1990) Formulating the single machine sequencing problem with release dates as a mixed integer program, Discrete Appl. Math. 26(2–3):255–270.Crossref, Google Scholar
• Fischetti M, Monaci M (2017) Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling. Eur. J. Oper. Res. 263(1):258–264.Google Scholar
• Kjenstad D, Mannino C, Schittekat P, Smedsrud M (2013) Integrated surface and departure management at airports by optimization, Proc. 5th Internat. Conf. Modeling, Simulation Appl. Optimization (ICMSAO) (IEEE, Piscataway, NJ), 1–5.Crossref, Google Scholar
• Lamorgese L, Mannino C (2015) An exact decomposition approach for the real-time train dispatching problem. Oper. Res. 63(1):48–64.Link, Google Scholar
• Lamorgese L, Mannino C, Natvig E (2017) An exact micro-macro approach to cyclic and non-cyclic train timetabling. Omega 72(C):59–70.Crossref, Google Scholar
• Lamorgese L, Mannino C, Piacentini M (2016) Optimal train dispatching by Benders’-like reformulation. Transportation Sci. 50(3):910–925.Link, Google Scholar
• Mannino C (2017) OPtimal Scheduling for next-generation intelligent TRAnsport systems. ProsjektBanken. Accessed March 26, 2019, https://www.forskningsradet.no/prosjektbanken/#/project/NFR/267554/Sprak=en.Google Scholar
• Mannino C, Mascis A (2009) Real-time traffic control in metro stations. Oper. Res. 57(4):1026–1039.Link, Google Scholar
• Marchand H, Wolsey LA (1999) The 0-1 knapsack problem with a single continuous variable. Math. Programming 85(1):15–33.Crossref, Google Scholar
• Mascis A, Pacciarelli D (2002) Job shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3):498–517.Crossref, Google Scholar
• Nemhauser GL, Wolsey LA (1999) Integer and Combinatorial Optimization (Wiley-Interscience, New York).Google Scholar
• Nielsen MN (2016) Danish State Railways, presentation at the Dagstuhl seminar on algorithmic methods for optimization in public transport. Accessed June 28, 2016, http://materials.dagstuhl.de/index.php?semnr=16171.Google Scholar
• Pinedo ML (2012) Scheduling: Theory, Algorithms, and Systems (Springer Science & Business Media, New York).Crossref, Google Scholar
• Queyranne M, Schulz AS (1994) Polyhedral approaches to machine scheduling. Technical Report 408/1994, Technische Universitat Berlin, Berlin.Google Scholar
• Schachtebeck M, Schöbel A (2010) To wait or not to wait - and who goes first? Delay management with priority decisions. Transportation Sci. 44(3):307–321.Link, Google Scholar
• Schlechte T, Borndörfer R, Erola B, Graffagnino T, Swarat E (2011) Micro-macro transformation of railway networks. J. Rail Transport Planning Management 1(1):38–48.Crossref, Google Scholar
• Schrijver A (2003) Combinatorial Optimization (Springer, Berlin).Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2015) Timing problems and algorithms: Time decisions for sequences of activities. Networks 65(2):102–128.Crossref, Google Scholar
• Zemel E (1978) Lifting the facets of zero-one polytopes. Math. Programming 15(1):268–277.Crossref, Google Scholar