1. T. Baar, P. Brucker, S. Knust, Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem, in: S. Voss, S. Martello, I. Osman, C. Roucairol (Eds.), Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Dordrecht, 1998, pp. 1–18
2. A branch and bound algorithm for the resource-constrained project scheduling problem;Brucker;European Journal of Operational Research,1998
3. E. Demeulemeester, Optimal algorithms for various classes of multiple resource-constrained project scheduling problem, Ph.D. thesis, Department of Applied Economic Sciences, Katholieke Universiteit Leuven, 1992
4. R. Heilmann, C. Schwindt, Lower Bounds for RCPSP/max, Report WIOR-511, Universität Karlsruhe, 1997
5. Computing lower bounds by destructive improvement – an application to resource-constrained project scheduling;Klein;European Journal of Operational Research,1999