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

Lecture February 28

We treated the following:

• Branch and bound in general (Slides or Jens Clausen's article)

• Repetition of Dynasearch (Slides or Congram et al.'s article from previous lecture)

• Parallel machine environments $Pm\:\vert\:prmp\:\vert\:C_{max}$ and $Qm\:\vert\:prmp\:\vert\:C_{max}$ (only cursive knowledge, photocopies from Lecture 9 in Documents section of the Black Board)

• Flow shops and Johnson's rule for $F2\:\vert\:prmu\:\vert\:C_{max}$ (photocopies for Lecture 10 in 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)

The next lecture we finish flow shop environment and begin with job shop.

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

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

• Job shop, disjunctive graph, shifting bottleneck heuristic (textbook pages 84 through 95).

In the last lecture notes some link to photocopies or articles were missing. These have been checked now.