Abstract
In this paper, we propose a new algorithmic approach to solve the large-sized instances of lot-sizing problem in capacitated pure flow shops with sequence-dependent setups within a reasonable computation time. Two solution algorithms are provided based on a more simplified version of the problem combining the rolling horizon approach with a specific heuristic. To evaluate the effectiveness of the proposed algorithms, some numerical experiments are conducted, and corresponding results are compared with those of previously developed heuristics by the authors. The comparative results indicate the superiority of the second proposed algorithm in solving the large-sized problem instances.
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: The International Journal of Advanced Manufacturing Technology
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.
