1. An Analysis of Totally Clairvoyant Scheduling

   • K. Subramani

   OriginalPaper Pages: 113 - 133

2. The k-Track Assignment Problem on Partial Orders

   • Paulo Barcia
   • J. Orestes Cerdeira

   OriginalPaper Pages: 135 - 143

3. An Advanced Tabu Search Algorithm for the Job Shop Problem

   • Eugeniusz Nowicki
   • Czesław Smutnicki

   OriginalPaper Pages: 145 - 159

4. Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

   • H. A. J. Crauwels
   • C. N. Potts
   • L. N. Van Wassenhove

   OriginalPaper Pages: 161 - 177

5. Scheduling trees with large communication delays on two identical processors

   • F. Afrati
   • E. Bampis
   • I. Milis

   OriginalPaper Pages: 179 - 190