Abstract
This paper studies capacitated production planning problem with sequence-dependent setups in a closed-loop supply chain. A multi-stage, multi-period multi-product problem is considered and manufacturing and remanufacturing activities of each product are conducted consequently without additional setup. A mixed integer programming (MIP) model is provided to formulate the problem. In order to solve the model, MIP-based heuristics using rolling horizon are developed which contain non-permutation and permutation heuristics. Moreover, a hybrid simulated annealing (SA) algorithm is proposed in order to solve the problem using a genetic algorithm (GA) to prepare an appropriate initial solution. Taguchi method is used to adjust the parameters of the developed hybrid SA and GA. Finally, the efficiency of the hybrid algorithm versus MIP-based algorithms is demonstrated using computational results.
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.
