1. Akl, S.G. (1989) The Design and Analysis of Parallel Algorithms, Prentice Hall, Englewood Cliffs, New Jersey.
2. Baker, K.R. (2005) Elements of Sequencing and Scheduling, Amos Tuck School of Business Administration, Dartmouth College, Hanover, NH.
3. Coffman, E. (1976) Computer & Job/Shop Scheduling Theory, John Wiley, New York.
4. Dell’Amico, M. (1996) Shop Problems with Two Machines and Time Lags, Operations Research, 44, 777–787.
5. Garey, M. and D. Johnson (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., New York.