Time-cost Optimization Model for Deterministic Network Projects

Avner BEN-YAIR
Zohar LASLO
Doron GREENBERG
Dimitri GOLENKO-GINZBURG

Keywords

deterministic PERT project, restricted pregiven budget assigned to the project, optimal local budgets assigned to project's activities, heuristic+iterative+algorithm, critical path's minimization

Abstract

A deterministic PERT activity-on-arc network  with logical operation "AND" at the event's receiver and "MUST FOLLOW" at the event's emitter, is considered. Each activity  entering the model can be operated within several deterministic durations    depending on the corresponding budgets    assigned to that activity. The problem centers on determining optimal budget values  to be assigned to each activity  in order to minimize the network's critical path subject to the restricted pregiven budget  assigned to the whole project .