Algorithmic approach to time-cost analysis of queued commodity flowing through critical path
by Prem Prakash Mishra; T. Poongodi; S.K. Yadav; S.S. Mishra
International Journal of Mathematics in Operational Research (IJMOR), Vol. 18, No. 2, 2021

Abstract: 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.

Online publication date: Wed, 10-Feb-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com