Modelling rearrangement constraints in dynamic layout Online publication date: Fri, 27-Dec-2013
by Jaydeep Balakrishnan; Chun-Hung Cheng; Chun Ming Lau
International Journal of Industrial and Systems Engineering (IJISE), Vol. 15, No. 4, 2013
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com