The task assignment problem for unrestricted movement between workstation groups Jonathan F. BardLin Wan OriginalPaper Pages: 315 - 341
An O(n 2 ) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness Zhongjun TianC. T. NgT. C. E. Cheng OriginalPaper Pages: 343 - 364
Minimizing migrations in fair multiprocessor scheduling of persistent tasks Tracy KimbrelBaruch SchieberMaxim Sviridenko OriginalPaper Pages: 365 - 379
On the connection between a cyclic job shop and a reentrant flow shop scheduling problem George SteinerZhihui Xue OriginalPaper Pages: 381 - 387
A note on the complexity of the concurrent open shop problem Thomas A. Roemer OriginalPaper Pages: 389 - 396