Abstract
Planning distributed manufacturing logistics is one of the main issues in supply chain management. This paper proposes a hybrid heuristic approach for the multi-level, multi-item capacitated lot sizing problem (MLCLSP) in supply chain network MLCLSP corresponds to a mixed integer programming (MIP) problem. With integer variable solutions determined by heuristic search, this MIP problem becomes linear program (LP). By repeatedly solving the relaxed MIP problems with a heuristic search method in a hybrid manner, this proposed approach allocates finite manufacturing resources for each distributed facilities and generates feasible production plans. Two heuristic search algorithms, tabu search and simulated annealing are presented to solve the MIP problems. The experimental test evaluates the computational performance under a variety of problem scenarios.
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 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.
