| Article ID: | iaor200930 |
| Country: | United Kingdom |
| Volume: | 46 |
| Issue: | 3 |
| Start Page Number: | 703 |
| End Page Number: | 722 |
| Publication Date: | Jan 2008 |
| Journal: | International Journal of Production Research |
| Authors: | Asef-vaziri A., Ortiz R.A. |
| Keywords: | vehicle routing & scheduling, programming: travelling salesman |
In this study we develop mathematical models to design circular material flow systems. We first develop a tight formulation to find the shortest loop covering all work centers within a manufacturing facility layout. The shortest loop is an attractive solution for most types of conveyors and power-and-free systems, where the length of the flow path is the major driver of the total cost. We develop a primal as well as a dual graph formulation and discuss their one-to-one correspondence in node-edge as well as in connectivity constraints.