1. Jacek Blazewicz et al. Handbook on Scheduling. Springer, 2019.
2. Dimitris Bertsimas and John N. Tsitsiklis. Introduction to linear optimization. Vol. 6. Athena scientific Belmont, MA, 1997.
3. Reinhard Diestel. Graph Theory. Vol. 173. Graduate Texts in Mathematics. 2017.
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
5. Hans Kellerer, Ulrich Pferschy, and David Pisinger. Knapsack Problems. Springer Berlin, Heidelberg, 2003.