DM204 - Scheduling, Timetabling and Routing

• [B1] Pinedo, M. Scheduling: Theory, Algorithms, and Systems Springer New York, 2008
• [B2] Pinedo, M. Planning and Scheduling in Manufacturing and Services Springer Verlag, 2005
• [B3] Toth, P. & Vigo, D. (ed.) The Vehicle Routing Problem SIAM Monographs on Discrete Mathematics and Applications, 2002

• [B4] Brucker, P. Scheduling Algorithms. Springer 2007
• [B5] Brucker, P. & Knust, S. Complex Scheduling. Springer Berlin Heidelberg, 2012
• [B6] Garey, M. R. & Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness Freeman, San Francisco, CA, USA, 1979
• [B7] L.A. Wolsey. Integer programming. John Wiley & Sons, New York, USA, 1998
• [B8] R.K. Ahuja, T.L. Magnanti and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993
• [B9] G. Desaulniers, J. Desrosiers and M.M. Solomon (ed.). Column Generation. Springer US, 2005.

• [A1] M.L. Fisher. The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science, 2004, 50(12) , 1861-1871
• [A2] M.E. Lübbecke. Column Generation. M.E., J.J. Cochran, L.A. Cox,P. Keskinocak, J.P. Kharoufeh and J.C. Smith (ed.). Wiley Encyclopedia of Operations Research and Management Science, John Wiley & Sons, Inc., 2010()
• [A3] A.A. Bertossi, P. Carraresi and G. Gallo. On some matching problems arising in vehicle scheduling models. Networks, Wiley, 1987, 17(3), 271-281
• [A4] P. Carraresi and G. Gallo. Network models for vehicle and crew scheduling. European Journal of Operational Research , 1984, 16(2) , 139 - 151
• [A5] I. Steinzen, V. Gintner, L. Suhl and N. Kliewer. A Time-Space Network Approach for the Integrated Vehicle- and Crew-Scheduling Problem with Multiple Depots. Transportation Science, 2010, 44(3), 367-382
• [A6] S. Gualandi and F. Malucelli. Resource Constrained Shortest Paths with a Super Additive Objective Function. M. Milano (ed.). CP, Springer, 2012, 7514, 299-315
• [A7] G. Lach and M. Lübbecke. Optimal University Course Timetables and the Partial Transversal Polytope. C. McGeoch (ed.). 7th International Workshop on Efficient and Experimental Algorithms (WEA08), Springer, 2008, 5038() , 235-248
• [A8] G. Lach and M. Lübbecke. Curriculum based course timetabling: new solutions to Udine benchmark instances. Annals of Operations Research, Springer US, 2012, 194(1) , 255-272
• [A9] B. Kallehauge, J. Larsen, O.B. Madsen and M.M. Solomon. Vehicle Routing Problem with Time Windows. in G. Desaulniers, J. Desrosiers and M.M. Solomon (ed.). Column Generation. Springer US, 2005.
• [A10] M.M. Solomon. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, 1987, 35(2), 254-266
• [A11] D. Pisinger and S. Ropke. A general heuristic for vehicle routing problems. Computers & Operations Research , 2007, 34(8) , 2403 - 2435
• [A12] J.-Y. Potvin and J.-M. Rousseau. An Exchange Heuristic for Routing Problems with Time Windows. The Journal of the Operational Research Society, Palgrave Macmillan Journals on behalf of the Operational Research Society, 1995, 46(12) , pp. 1433-1446
• [A13] G. Kindervater and M. Savelsbergh. Vehicle Routing: Handling Edge Exchanges. E. Aarts and J. Lenstra (ed.). Local Search in Combinatorial Optimization, Wiley, 1997, 337-360

• Gurobi

External links with motivations for the course:

• Periodic Timetable Optimization
• The job of Discrete Optimisers

• Is a career in O.R. and Analytics right for you?
• The New Dutch Timetable: The O.R. Revolution
• Examples of contributions of operations research and analytics in both the profit and non-profit sectors
• Last ROADEF competition: machine reassignment
• Transportation science and logistics

• What is OR?
• ROGO game

Date: October 31, 2013. List of questions