ALGORITHMIC APPROACH TO TIME-COST ANALYSIS OF QUEUED COMMODITY FLOWING THROUGH CRITICAL PATH

Here, an attempt has been made to develop an algorithm for optimisation of queued commodity flow under finite capacity constraints. It is a simulation of optimum queued commodity-flow in random network as an extension of Ford Fulkerson algorithm used in the notion of delivery scheduling. The execution of the queued commodity-flow through different routes of deliveries and its scheduling using CPM/PERT has been made. By this execution, the total delivery completion time is minimised in order to meet the scheduled time. Implementation of algorithm has been done through appropriate illustration of network to yield intended results for future application of the model. Final results are exhibited in three tables.