Modelling Rearrangement Constraints in Dynamic Layout

Abstract

The dynamic plant layout problem (DPLP) deals with multi-period layout plans. Genetic algorithms have proved to be effective in solving DPLPs. In this research we consider a constraint on rearrangement. Such constraints may have to be considered not only in multi-period plant layout, but also in multi-period plant location and multi-period cellular manufacturing. We suggest proactive and reactive heuristic methods that can be used to modify existing genetic algorithms for the constrained situation. An extensive computational study is carried out to compare the proposed heuristics.