1. Minimizing Total Weighted Tardiness in a Generalized Job Shop

   • K. M. J. De Bontridder

   Papers Pages: 479 - 496

2. A Computational Study of a Cutting Plane Algorithm for University Course Timetabling

   • Pasquale Avella
   • Igor Vasil'Ev

   Papers Pages: 497 - 514

3. Discovering Dispatching Rules Using Data Mining

   • Xiaonan Li
   • Sigurdur Olafsson

   Papers Pages: 515 - 527

4. Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem

   • Pawel Jan Kalczynski
   • Jerzy Kamburowski

   Papers Pages: 529 - 536

5. A note on the scheduling with two families of jobs

   • J. J. Yuan
   • W. P. Shang
   • Q. Feng

   Technical Note Pages: 537 - 542

6. Mathematical Programming and Financial Objectives for Scheduling Projects

   • Salah Elmaghraby

   Book Review Pages: 543 - 546

7. Conference Diary

   • Dirk Christian Mattfeld

   OriginalPaper Pages: 547 - 550

8. Erratum: An Analysis of Totally Clairvoyant Scheduling

   • K. Subramani

   Errata Pages: 551 - 552