New Model On Multi Floor Simple And Dynamic Plant Layout Problems (MF-SPLP and MF-DPLP)

Abstract

Abstract Plant layout problems are well researched problems (see Singh and Sharma [10]) for references. SPLPs (simple plant layout problem) are single period problems where one allots facilities to slots so that sum total of material handling cost is minimized; whereas DPLPs (dynamic plant layout problem) are multi-period problems. In DPLP the flows between facilities or machines change as old products are weeded out and newer ones are added. This necessitates that facilities be relocated to different slots so that we have minimized the sum total of relocation cost and the material handling cost. These problems are known to be NP-Hard. Multi-Floor (MF) layout problems are more complex. Here we give three model on MF-SPLP, MF-DPLP and MF sequence dependent DPLP. Novel formulations and its new linearization(s) are given.