Abstract
In order to coordinate the supply chain, reordering strategy of needed goods must be synchronised and sequence of production and replenishment cycle time must be optimised in terms of cost. Therefore, this paper studies the economic lot and delivery scheduling problem for multi-stage supply chain. The common cycle time and integer multiplier policies were adopted to accomplish the desired synchronisation. In this regard, a new mathematical model has been presented where a manufacturer with open-shop system purchases raw materials from suppliers and sends them to packaging companies after converting them into the final product and then they are sold. Since this is a non-deterministic polynomial-time hard (NP-hard) problem, simulated annealing algorithms have been developed for it. For this algorithm, two different scenarios have been proposed for solving the study problem and at the end the numerical results have been applied on problems with different dimensions by the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Manufacturing Technology and Management
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.
