In many seasonal industries, customer demands are constantly changing over time, and accordingly the facility layout should be re-optimized in a timely manner to adapt to changing material handling patterns among manufacturing departments. This paper investigates the aperiodic facility layout problem (AFLP) that involves arranging facilities layout and re-layout aperiodically in a dynamic manufacturing environment during a given planning horizon. The AFLP is decomposed into a master problem and a combination set of static facility layout problems (FLPs, the slave problems) without loss of optimality, and all problems are formulated as mixed-integer linear programming (MILP) models that can be solved by MIP solvers for small-sized problems. An exact backward dynamic programming (BDP) algorithm with a computational complexity of O(n 2) is developed for the master problem, and an improved linear programming based problem evolution algorithm (PEA-LP) is developed for the traditional static FLP. Computational experiments are conducted on two new problems and twelve well-known benchmark problems from the literature, and the experimental results show that the proposed solution approach is promising for solving the AFLP with practical sizes of problem instances. In addition, the improved PEA-LP found new best solutions for five benchmark problems.
Bibliographical noteThis is an Accepted Manuscript of an article published by Taylor & Francis Group in International Journal of Production Research on 22 June 2020, available online at: http://www.tandfonline.com/10.1080/00207543.2020.1775909
- dynamic programming
- evolutionary algorithm
- Facility layout
- mixed-integer linear programming