This session will be updated during the course.

Methods

• Laurence A. Wolsey. Integer programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, New York, USA, 1998.
• Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs, New Jersey, USA, second edition, 2003.
• Apt, K. R. (2003). Principles of Constraint Programming. Cambridge University Press.
• Kim Marriott and Peter J. Stuckey (1998), Programming with constraints: An introduction. 467 pp. MIT Press, Cambridge, Mass. USA.
• Jens Clausen. (2003). Branch and bound Algorithms. Principles and Examples.
• NEOS Server on optimization.
• ZIB Optimization Suite, includes ZIMPL (documentation), SCIP and SoPlex.
• M. Fischetti and A. Lodi, Local Branching, Mathematical Programming, 98(1-3), pp 23-47, 2003.
• Constraint Programming: Global Constraints and Systems
• Constraints Archive

Scheduling

• Michael L. Pinedo, Planning and Scheduling in Manufacturing and Services. Springer Series in Operations Research and Financial Engineering, 2005. (textbook)
• Michael L. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, second edition, 2002.
• Peter Brucker and Sigrid Knust (2006). Complex Scheduling, Series: GOR-Publications, Springer-Verlag, Germany.
• Complexity results for scheduling problems by Peter Brucker, Sigrid Knust.
• Congram, Richard K., Potts, Chris N., van de Velde, Steef L. An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem. INFORMS Journal on Computing, 2002, 14(1), p52.
• E. Taillard. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 1990, 47(1), 65-74.
• J. Grabowski, M. Wodecki A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion Computers & OR 31(11): 1891-1909 (2004)
• R. Ruiz and T. Stützle. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem European Journal of Operational Research, 177(3), 2007, Pages 2033-2049.

Timetabling

• D. de Werra, An introduction to timetabling, European Journal of Operational Research, 19(2), 151-162 (1985)
• A. Schaerf. A Survey of Automated Timetabling. Artificial Intelligence Review 13(2): 87-127 (1999)
• H. Arntzen and A. Løkketangen. A tabu search heuristic for a university timetabling problem. International Timetabling Competition (2003).
• Liam T. G. Merlot, Natashia Boland, Barry D. Hughes, Peter J. Stuckey: A Hybrid Algorithm for the Examination Timetabling Problem. PATAT 2002: 207-231
• G.Lach, M.E.Lübbecke (2008). Curriculum based course timetabling: Optimal solutions to the Udine benchmark instances.. Tech. Rep. 9, TU Berlin, Institut für Mathematik.
• G.Lach, M.E.Lübbecke (2007). Optimal university course timetables and the partial transversal polytope. Tech. Rep. 45, TU Berlin, Institut für Mathematik. To appear in the proceedings of WEA2008.
• I. Blöchliger, N. Zufferey (2008). A graph coloring heuristic using partial solutions and a reactive tabu scheme Computers & Operations Research, vol. 35, no. 3, pp. 960-975.
• PATAT (Practice and Theory of Automated Timetabling) (International Conference Series)
• The EURO Working Group on Automated Timetabling
• SaTT Scheduling and Timetabling Group
• ASAP Automated Scheduling, Optimization and Planning Group
• Timetabling Problem Database
• International Timetabling Competition
• EasyStaff (business company doing timetabling).
Rasmus V. Rasmussen, Michael A. Trick, Round robin scheduling – a survey European Journal of Operational Research, Volume 188, Issue 3, 1 August 2008, Pages 617-636
• C. Barnhart, P. Belobaba, A. Odoni, Applications of Operations Research in the Air Transport Industry, Transportation Science, 2003, vol. 37, issue 4, p 368.
• R. Borndörfer, M. Grötschel, M. E. Pfetsch (2005). Public transport to the fORe!. Tech. Rep. ZIB Report 05-22, Zuse-Institut Berlin, Takustr. 7, 14195 Berlin.
• Bartholdi III, John J., Orlin, James B., Ratliff, H. Donald. Cyclic Scheduling via Integer Programs with Circular Ones. Operations Research. 1980 Vol. 28 Issue 5, p1074.

Routing

• Traveling Salesman Problem by David Applegate, Robert Bixby, Vašek Chvátal and William Cook.
• P. Toth, D. Vigo, eds. The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2002.
• G.A.P. Kindervater, M.W.P. Savelsbergh (1997). Vehicle Routing: Handling Edge Exchanges. E.H.L. Aarts, J.K. Lenstra (eds.). Local Search in Combinatorial Optimization, Wiley, Chichester, 337-360.
• The VRP Web.
• P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, LNCS Volume 1520, pp. 417-431, 1998
• David Pisinger, Stefan Ropke, A general heuristic for vehicle routing problems Computers & Operations Research, Volume 34, Issue 8, August 2007, Pages 2403-2435.