1. I. Averbakh, O. Berman, I. Chernykh. A polynomial algorithm for minimizing the total completion time in m-machine flowshop with unit-time operations and intree precedence constraints. Working paper, Rotman school of management, University of Toronto, 2003.
2. P. Baptiste, P. Brucker, S. Knust, V. Timkovsky. Fourteen notes on equal-processing-time scheduling, Technical report, , 2002.
3. Complexity results for single-machine problems with positive finish-start time-lags;Brucker;Computing,1999
4. Parallel sequencing and assembly line problems;Hu;Oper. Res.,1961