Title: Modelling rearrangement constraints in dynamic layout
Authors: Jaydeep Balakrishnan; Chun-Hung Cheng; Chun Ming Lau
Addresses: Operations Management Area, Haskayne School of Business, University of Calgary, Calgary, Alberta T2N 1N4, Canada ' Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong ' Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong
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.
Keywords: multi-period plant layout; layout planning; integer programming; heuristics; genetic algorithms; modelling; rearrangement constraints.
DOI: 10.1504/IJISE.2013.057475
International Journal of Industrial and Systems Engineering, 2013 Vol.15 No.4, pp.373 - 393
Published online: 27 Dec 2013 *
Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article