Algorithmic approach to time-cost analysis of queued commodity flowing through critical path

Prem Prakash Mishra, T. Poongodi, S.K. Yadav and S.S. Mishra

International Journal of Mathematics in Operational Research, 2021, vol. 18, issue 2, 169-186

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.

Keywords: cost function; development of algorithm; CPM/PERT; M/M/1/N queuing model. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=112934 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:18:y:2021:i:2:p:169-186

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().