The track formulation for the train dispatching problem

Electronic Notes in Discrete Mathematics

Volumn 41, Issue , 2013, Pages 559-566

  Lamorgese, Leonardo ^a   Mannino, Carlo ^a  

^a SINTEF ICT   (Norway)

Author keywords

Disjunctive formulation; Dispatching; Rescheduling

Indexed keywords

EID: 84879726563     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2013.05.138     Document Type: Article

References (7)

1. Balas E. Machine sequencing via disjunctive graphs. Operations Research 1969, 17:941-957.
2. Codato G., Fischetti M. Combinatorial Benders' Cuts for Mixed-Integer Linear Programming. Operations Research 2006, 54(4):756-766.
3. Corman F., Rail-time railway traffic management: dispatching in complex, large and busy railway networks, Ph.D. Thesis, TRAIL Thesis Series T2010/14, the Netherlands TRAIL Research School.
4. C. Mannino, Real-time traffic control in railway systems, in: A. Caprara, S. Kontogiannis (Eds.), Proceedings of Atmos'11, in: OASICS, vol. 20, 2011.
5. L. Lamorgese, C. Mannino, An exact decomposition approach for the real-time train dispatching problem, Technical Report N. A23274, SINTEF ICT, Norway, 2012, submitted.
6. Mascis A., Pacciarelli D. Job shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 2002, 143(3):498-517.
7. Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization 1999, Wiley-Interscience.