External Links

    Journal: J. Scheduling

    Volume 9, Issue 4

    315 -- 341Jonathan F. Bard, Lin Wan. The task assignment problem for unrestricted movement between workstation groups
    343 -- 364Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng. An O(n:::2:::) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
    365 -- 379Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko. Minimizing migrations in fair multiprocessor scheduling of persistent tasks
    381 -- 387George Steiner, Zhihui Xue. On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
    389 -- 396Thomas A. Roemer. A note on the complexity of the concurrent open shop problem
    397 -- 400. Conference Diary
    runs on