Abstract
In a network the nodes represent stations, warehouses, distribution centers and customers and not just materials but also information circulate, so the minimum cost flow model, that only takes transport costs into account is one of the tools used to support the decision-making. In reality, the nodes provide a service which requires a service time, the servicing follows a discipline and also a queue is formed, generating the respective service and queuing costs. A modified version of the minimum cost flow model is proposed in this paper for the optimization of the flow in a queuing network. A variety of cases were solved. An acceptable level of accuracy was observed in the calculation of the time cycle and work in progress. The results indicate that the optimum solution tends to balance the workload along the network. This paper is of interest to administrators and people in charge of supply chains and is useful for decision-making in the medium or long time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.