Abstract:
Given a project, drawn in the form of a PERT/CPM network, it describes an algorithm which can find the minimum cost schedule of the project when its time is to be reduced (compressed) under a given crash programme. It is assumed that, for each activity of the project, the normal time and cost as well as its desired scheduled (crash) time with cost are given. The algorithm has been implemented in FORTRAN and its process of cost optimization illustrated by means of a network example. The different minimum cost schedules are determined between the normal and crash points and then the optimum cost schedule is found under the given crash programme.
Page(s):
110-133
DOI:
DOI not available
Published:
Journal: Research journal, Volume: 1, Issue: 2, Year: 1987