Please use this identifier to cite or link to this item:
Title: Modelling Rearrangement Constraints in Dynamic Layout
Authors: Balakrishnan, Jaydeep
Cheng, Chun Hung
Lau, Chun Ming
Keywords: Layout;Planning;Integer programminmg;Heuristics;Genetic Search
Issue Date: 2013
Publisher: InderScience Publishers
Citation: Balakrishnan J., Cheng C.H., and Lau E.C.M “Modelling rearrangement constraints in dynamic layout”, International Journal of Industrial and Systems Engineering, 15, 4, 2013, pp 373-393.
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.
Description: Post print of Article deposited 05/13/2016 according to publisher DOI for the article 10.1504/IJISE.2013.057475
ISSN: 1748-5045
Appears in Collections:Balakrishnan, Jaydeep

Files in This Item:
File Description SizeFormat 
CDPLP_heuristic.doc444.5 kBMicrosoft WordView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.