1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co, New York (1979)
2. Christofides, N.: Graph Theory. An Algorithmic Approach. Academic Press, New York (1975)
3. https://www.mathematik.uni-osnabrueck.de/research/OR/class. Accessed 23 Jan 2021
4. Simanchev, R.Y., Urazova, I.V.: An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences. Autom. Remote Control 71(10), 2102–2108 (2010). https://doi.org/10.1134/S0005117910100097
5. Simanchev, R.Y., Urazova, I.V.: The polytope of schedules of identical jobs on parallel processors (Russian). Diskretn. Anal. Issled. Oper. 18(11), 85–97 (2011)