1. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, McGraw Hill (1990).
2. M.E. Dyer and L.A. Wolsey, “Formulating the single machine sequencing problem with release dates as a mixed integer program”, Discrete Applied Mathematics, 26, 255–270 (1990).
3. S. Fujishige, “Submodular functions and optimization”, Annals of Discrete Mathematics, 47, North-Holland (1991).
4. L.A. Hall, D.B. Shmoys and J. Wein, “Scheduling to minimize average completion time: Off-line and on-line algorithms”, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 142–151, 1996.
5. L. Lovász, “Submodular functions and convexity”, in: A. Bachem, M. Grötschel and B. Korte (eds.), Mathematical Programming: The State of the Art, Bonn, 1982, Springer, Berlin, 235–257, 1983.