| Article ID: | iaor199434 |
| Country: | United States |
| Volume: | 39 |
| Issue: | 5 |
| Start Page Number: | 654 |
| End Page Number: | 655 |
| Publication Date: | May 1993 |
| Journal: | Management Science |
| Authors: | Balakrishnan Jaydeep |
| Keywords: | programming: dynamic, networks, graphs |
This note develops a fathoming procedure for the Dynamic Plant Layout Problem discussed by Rosenblatt. This procedure can be used to reduce the number of candidate static layouts to be examined. An important feature of the present procedure is that a feasible dynamic solution is not required in order to apply it. The effectiveness of this procedure depends on the relative magnitude of the shifting costs.