COMSARS: A computer-sequencing approach to multiresource constrained scheduling. Part 1: Deterministic networks

The paper presents a new methodology, COMSARS, which has been developed in response to the problems associated with the planning and scheduling of projects where the availability of a multiplicity of resources is constrained. The methodology is such that an assignment is made by selecting at random from the list of activities that could be scheduled at any point in time. During the iterative process, successive improvements of the project completion time are achieved through the ability to deploy resources as soon as they are available. Thus, COMSARS attempts to produce schedules that minimize the total project-completion time while minimizing the financial costs of resources. In the first part of a two-part paper, the methodology is designed around the framework of deterministic (activity-on-arc) networks; a second paper will integrate the methodology within the framework of stochastic network modelling. The methodology is applied in a case study involving the construction of a bunker project, where the 36 activities involved utilize as many as six different resource types. The results obtained for the case study give a chronological listing of all the activities that start and finish at various identifiable milestones througout the entire project duration. Further, COMSARS gives the resources-aggregation profiles corresponding to each of the project milestones enhanced in terms of their availabilities, requirements and actual utilization, as well as their levels of idleness. From such results, one can anticipate future resource demands, and make valuable judgments as to when scarce, expensive and limited resources will be hired or fired, therby facilitating project-cost savings.