Linear Programming Solution to Network Compression

Publisher Website
Google Scholar
Abstract
A technique for compressing networks is developed. The reduction of project duration, keeping the additional total cost a minimum, is achieved by a cost optimization linear programming model formulated from a chain-bar chart. The final solution is obtained using the computer. The method is applicable to any large network, part of a network and to multi-fragnet networks. The main advantage of this technique is its ability to solve the time-cost trade off problems for overlapping precedence networks. The additional cost of crashing any particular activity is obtained by making the assumption that the cost slope is linear between normal and crash points in the cost-duration curve. The method is simple and of low computational cost.

This publication has 0 references indexed in Scilit: