| Article ID: | iaor20053128 |
| Country: | United Kingdom |
| Volume: | 43 |
| Issue: | 9 |
| Start Page Number: | 1879 |
| End Page Number: | 1887 |
| Publication Date: | May 2005 |
| Journal: | International Journal of Production Research |
| Authors: | Laporte Gilbert, Farahani R. Zanjirani, Sharifyazdi M. |
| Keywords: | programming: linear |
The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a relatively simple algorithm is presented. It is shown that instances containing up to 60 cells can be solved optimally by using a commercial integer linear programming solver embedded within an iterative scheme.