1. Garey, M.R., Johnson, D.S., Computers and intractability a guide to the theory of NP completeness, W.H. Freeman and Company, New York, 1979.
2. Pritsker, A., Allan, B., Watters, L.J., Wolfe, P.M., Multiproject scheduling with limited resources: A zero-one programmingapproach, Management Science, 16, (1969), 93–- 108.
3. Mohanthy, R.P., Siddiq M. K., Multiple projects multiple resources-constrained scheduling: Some studies. International Journal of Production Research, 27 (1989), 261-280.
4. Deckro, R.F., Winkofsky, E.P., Hebert, J.E., Gagnon, R., A decomposition approach to multi-project scheduling, European Journal of Operational Research, 51, (1991), 110-118.
5. Jolayemi, J.K., scheduling of projects under penalty and reward arrangements: A mixed integer programming model and its varients, Academy of Information and Management Science Journal, 15, (2012), 29-52.