M.L. Pinedo, Scheduling Theory, Algorithms and Systems, Springer, New York, 2016.
• T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Ed., MIT Press, 2008.
• R. C. T. Lee, R.C. Chang, S.S. Tseng, and Y.T. Tsai, Introduction to the Design and Analysis of Algorithms: A Strategic Approach, McGraw Hill, 2005.
• M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman W.H., 1979.
• G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer-Verlag, 2003, Germany.
• Selected journal articles
E. Horowitz, S. Sahni, and S. Anderson-Freed, Fundamentals of Data Structures in C, Silicon Press, New Jersey, 2007.
R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5th ed., Pearson, 2003.
T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Ed., MIT Press, 2008.