A new algorithmic approach for capacitated lot-sizing problem in flow shops with sequence-dependent setups

摘要

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.