IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v18y2021i2p169-186.html
   My bibliography  Save this article

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

Author

Listed:
  • Prem Prakash Mishra
  • T. Poongodi
  • S.K. Yadav
  • S.S. Mishra

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.

Suggested Citation

  • Prem Prakash Mishra & T. Poongodi & S.K. Yadav & S.S. Mishra, 2021. "Algorithmic approach to time-cost analysis of queued commodity flowing through critical path," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 18(2), pages 169-186.
    • Handle: RePEc:ids:ijmore:v:18:y:2021:i:2:p:169-186
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=112934
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:18:y:2021:i:2:p:169-186. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.