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

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

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.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0