1. Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

   • Wenci Yu
   • Han Hoogeveen
   • Jan Karel Lenstra

   OriginalPaper Pages: 333 - 348

2. Scheduling Search Procedures

   • Peter Damaschke

   OriginalPaper Pages: 349 - 364

3. Approximating the Advertisement Placement Problem

   • Ari Freund
   • Joseph (Seffi) Naor

   OriginalPaper Pages: 365 - 374

4. Robotic Cells with Parallel Machines: Throughput Maximization in Constant Travel-Time Cells

   • H. Neil Geismar
   • Milind Dawande
   • Chelliah Sriskandarajah

   OriginalPaper Pages: 375 - 395

5. Conference Diary

   • Dirk C. Mattfeld

   Conference Report Pages: 397 - 399