| 237 | -- | 243 | Byung-Cheon Choi, Suk-Hun Yoon. Maximizing the weighted number of just-in-time jobs in flow shop scheduling |
| 245 | -- | 254 | Mikel Lezaun, Gloria Pérez, Eduardo Sáinz de la Maza. Rostering in a rail passenger carrier |
| 255 | -- | 261 | Dvir Shabtay, George Steiner. Single machine batch scheduling to minimize total completion time and resource consumption costs |
| 263 | -- | 269 | Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza. Semi on-line scheduling on three processors with known sum of the tasks |
| 271 | -- | 292 | Kerem Bülbül, Philip M. Kaminsky, Candace A. Yano. Preemption in single machine earliness/tardiness scheduling |
| 293 | -- | 301 | Xiaoqiang Cai, Liming Wang, Xian Zhou. Single-machine scheduling to stochastically minimize maximum lateness |
| 303 | -- | 310 | Yong He, Qi Wei, T. C. E. Cheng. Single-machine scheduling with trade-off between number of tardy jobs and compression cost |
| 311 | -- | 326 | Mario Vanhoucke, Dieter Debels. The discrete time/cost trade-off problem: extensions and heuristic procedures |
| 327 | -- | 336 | Marcello Sammarra, Jean-François Cordeau, Gilbert Laporte, Maria Flavia Monaco. A tabu search heuristic for the quay crane scheduling problem |
| 337 | -- | 339 | . Conference diary |