DMP87 - Scheduling, Timetabling and Routing
Weekly Notes
Lecture 5, Fall 2008

Lecture February 11

This lecture consisted in practical exercises on mathematical programming:

• Overview of available software and working cycle (slides).

• Case 1: Sequencing a welding robot (case due to M. Grötschel and T. Koch, ZIB, Berlin).

• Case 2: Solving Sudoku instances.

Links to the text of the two cases, the input data and the solution ZIMPL model are available together with these notes.

The next lecture we do practical exercises on local search. This entails programming in class. We agreed to use C/C++ as working language. Tomorrow, some basic functions to speed up the implementation will become available from the Lecture Notes session.

Assignment

Exercise 1

Write the integer programming formulation of $J4\vert\vert C_{max}$ and implement the model in ZIMPL. Solve the instance available with the Lecture Notes. (You may compare your solution with the one in Figure C.2 on page 426 of the textbook).