A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology

Thesis (M.Eng.) - Asian Institute of Technology, 1988

Project scheduling by the use of activity networks is an important problem under construction management . Many heuristic methods as well as modern techniques like PERT , CPM are being used for this purpose. But, scheduling the activities becomes very difficult when resources are limited especially when multiple concurrent projects are involved under the same executing body. It therefore requires the use of elaborate mathematical programming techniques Much of the present research has been centered around this problem and various mathematical models have been developed . But so far no effort has been made to assess an actual situation involving a high magnitude of work in totality . In this study four ongoing projects comprising a total of 157 activities have been considered which are administered by the same organisation , and have constraint of funds. Fund is the only resource that is considered here For scheduling t he activities o f all these projects a zero-one integer programming mode l has been chosen. This model can accommodate a wide range of real world situations including multiple resource aspects , due dates , precedence relationship between activities etc . Scheduling has been carried out using the model for considering the cases, with and without inflation. A comparative performance of the obtained schedule under these two situations and with the original CPM schedule has also been tested .