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

Lecture February 21

We completed the part on general solution methods with:

• Dispatching rules (Appendix C, textbook).

• Composite dispatching rules (Appendix C, textbook).

In the single machine scheduling case we reviewed the following algorithms:

• weighted shortest processing time first for $1 \: \vert\: \vert\: \sum w_j C_j$;

• dynamic programming algorithm for $1\: \vert\: prec \vert\: L_{max}$

• dynamic programming algorithm for $1\: \vert\: \vert\: \sum h_j(C_j)$

• the Gilmore and Gomory algorithm for the special case of $1\: \vert\: s_{jk}\: \vert\: C_{max}$

The next lecture we consider the branch and bound algorithm for $1\: \vert\: r_j \: \vert \: L$ (paragraph 3.2 of the photocopies from Lecture 8, or appendix B.4, pag. 402 of the textbook); the dynasearch algorithm for $1 \: \vert\: \vert\: \sum w_jT_j$ (section 3 of the paper by Congram Potts and Van De Velde) and some of the cases from the parallel machine environment described in the photocopies made available from the section Documents of the Black Board.