 1

I. Averbakh, O. Berman, and I. Chernykh.
The mmachine flowshop problem with unittime operations and
precedence constraints.
Oper. Res. Lett., 33(3):263266, 2005.
 2

P. Baptiste and V. Timkovsky.
Shortest path to nonpreemptive schedules of unittime jobs on two
identical parallel machines with minimum total completion time.
Math. Methods Oper. Res., 60(1):145153, 2004.
 3

P. Brucker and S. Knust.
Complexity results for singlemachine problems with positive
finishstart timelags.
Computing, 63:299316, 1999.
 4

J. Bruno, J.W. Jones, III, and K. So.
Deterministic scheduling with pipelined processors.
IEEE Trans. Comput., 29(4):308316, 1980.
 5

M.R. Garey, D.S. Johnson, and R. Sethi.
The complexity of flowshop and jobshop scheduling.
Math. Oper. Res., 1(2):117129, 1976.
 6

S.M. Johnson.
Optimal twoandthreestage production schedules with setup times
included.
Naval Res. Logist. Quart., 1:6168, 1954.
 7

J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker.
Complexity of machine scheduling problems.
Ann. of Discrete Math., 1:343362, 1977.
 8

J.Y.T. Leung, O. Vornberger, and J.D. Witthoff.
On some variants of the bandwidth minimization problem.
SIAM J. Comput., 13(3):650667, 1984.
 9

V.S. Tanaev, Y.N. Sotskov, and V.A. Strusevich.
Scheduling theory. Multistage systems, volume 285 of Mathematics and its Applications.
Kluwer Academic Publishers Group, Dordrecht, 1994.
Translated and revised from the 1989 Russian original by the authors.
 10

V.G. Timkovsky.
Identical parallel machines vs. unittime shops and preemptions vs.
chains in scheduling complexity.
European J. Oper. Res., 149(2):355376, 2003.
WWW daemon apache
20090629