Imprecise project network scheduling using possibilistic programming approach

Abstract

This work develops a possibilistic programming approach to solve imprecise project network scheduling (PNS) problems with multiple goals. The imprecise multi-objective PNS model designed here attempts to minimize total project costs and total completion time with reference to direct costs, indirect costs, contractual penalty costs, duration of activities and the constraint of available cost budget. An industrial case is used to demonstrate the feasibility of applying the proposed approach to real-life PNS problems. Several significant managerial implications for practical application of the proposed approach are also presented. The important contribution of this work lies in presenting a possibilistic mathematical programming methodology for solving the practical multi-objective PNS problems.