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

Authors: Prem Prakash Mishra; T. Poongodi; S.K. Yadav; S.S. Mishra

Addresses: Department of Mathematics, National Institute of Technology, Nagaland, India ' Department of Mathematics, National Institute of Technology, Nagaland, India ' Department of Statistics, Babasaheb Bhimrao Ambedkar University, Lucknow-226025, U.P., India ' Department of Mathematics and Statistics, Dr. Rammanohar Lohia Avadh University, Ayodhya-224001, India

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.

DOI: 10.1504/IJMOR.2021.112934

International Journal of Mathematics in Operational Research, 2021 Vol.18 No.2, pp.169 - 186

Received: 06 May 2019
Accepted: 01 Nov 2019

Published online: 10 Feb 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article