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

DOI10.1504/IJMOR.2021.112934zbMATH Open1482.90047OpenAlexW4232726860MaRDI QIDQ2247685FDOQ2247685

Authors: Yanyan Li 

Publication date: 17 November 2021

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2021.112934

Recommendations

• Optimal flows in dynamic networks and algorithms for their finding
• Minimum cost time-varying network flow problems
• An exact algorithm for a multicommodity min-cost flow over time problem
• scientific article; zbMATH DE number 5990494
• Contemporary methods in network optimization process

zbMATH Keywords

cost function\(m/M/1/N\) queuing modelCPM/PERTdevelopment of algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22)

Cited In (1)

• Determination of EOQ in terms of optimum degrees of horizontal and vertical cooperation at a node of supply chain

This page was built for publication: Algorithmic approach to time-cost analysis of queued commodity flowing through critical path

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247685)