1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).
2. A. V. Eremeev and Yu. V. Kovalenko, “On Scheduling with Technology Based Machines Grouping,” Diskretn. Anal. Issled. Oper. 18 (5), 54–79 (2011).
3. A. V. Eremeev and Yu. V. Kovalenko, “On Complexity of Optimal Recombination for One Scheduling Problem with Setup Times,” Diskretn. Anal. Issled. Oper. 19 (3), 13–26 (2012).
4. R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling (Addison-Wesley, Reading, MA, USA, 1967; Nauka, Moscow, 1975).
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA, 1990; MTsNMO, Moscow, 2001).