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

Lecture February 25

We continued dealing with single machine models focusing on branch and bound solutions.

• Numerical example for $1\: \vert\: s_{jk}\: \vert\: C_{max}$ (Photocopies lec-8-b from Documents)

• Branch and bound for $1\:\vert\:r_j,(prec)\:\vert\:L_{max}$ (Photocopies lec-8 from Documents)

• Moore's algorithm for $1\:\vert\:\:\vert\:U$ (Photocopies lec-8 from Documents)

• Branch and bound for $1\:\vert\:\:\vert\:\sum w_jT_j$ (Slides)

• Dynasearch for $1\:\vert\:\:\vert\:\sum w_jT_j$ (Section 3, Congram, Potts, van de Velde's article)

The next lecture we treat:

• parallel machine environments $Pm\:\vert\:prmp\:\vert\:C_{max}$ and $Pm\:\vert\:prmp\:\vert\:C_{max}$ (photocopies from lecture 9)

• Flow shops and Johnson's rule for $F2\:\vert\:prmu\:\vert\:C_{max}$ (photocopies available from the Documents section of the Black Board)

• Campbell et al.'s heuristic for $Fm\:\vert\:prmu\:\vert\:C_{max}$ (slides)

• Nawaz, Enscore and Ham's heuristic for $Fm\:\vert\:prmu\:\vert\:C_{max}$ (Sections 3 and 4 of Taillard's article, photocopies available from the Documents section of Black Board)

• Tabu Search for $Fm\:\vert\:prmu\:\vert\:C_{max}$ (skim through sections 1-3 of Grabowski and Wodecki)

• Iterated Greedy for $Fm\:\vert\:prmu\:\vert\:C_{max}$ (skim through section 3, 3.4 excluded, of the paper by Ruiz and Stützle)