Abstract
Abstract In this paper we investigate the demand planning problem for a petrochemical industry four tiers supply chain that integrates lot-sizing, scheduling with sequence dependent transient costs, transportation and warehousing decisions between suppliers, plants, warehouses, and customers. The problem was modeled using Mixed-Integer Linear Programming (MILP) and featuring a setup carryover and sub-tours elimination constraints. The problem is NP-Hard; therefore, an iterative three stage heuristic was developed which provides quality solutions with a very acceptable computational time. The heuristic computational efficiency was tested on different problem instances of different sizes, and the reported results were within a range of 0.09–2.00% gap from optimality.
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 callDisclaimer: 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.
