Process Network Solution of Extended CPM Problems with Alternatives

Abstract

In this paper a novel method to extend the problem range of CPM problems is given. First, the CPM problem is transformed into a process network problem. It is shown how the directed bipartite process network has to be generated, and the corresponding mathematical programming model should be formulated. Time optimal, cost optimal, time optimal with additional cost constraints and cost optimal with additional time constraints mathematical programming models are given. Moreover, it is illustrated how alternative cases may appear in the structure. An example illustrates the efficiency of the present work.