Article ID: | iaor20013602 |
Country: | United States |
Volume: | 37 |
Issue: | 4 |
Start Page Number: | 847 |
End Page Number: | 858 |
Publication Date: | Dec 1999 |
Journal: | Computers & Industrial Engineering |
Authors: | Wilson J.M., Foulds L.R. |
Keywords: | programming: branch and bound, production: FMS |
We describe a branch and bound algorithm for an assignment problem subject to a special set of side constraints. The problem has application in the design of tool carousels for certain flexible manufacturing systems. The resulting model represents a special case of the restricted facilities layout problem in which it is forbidden to locate any facility in certain zones. The bounds for the algorithm are generated by relaxing the side constraints and using the Hungarian method to solve the resulting assignment problem. Partitioning in a manner similar to subtour elimination for the travelling salesman problem leads to encouraging computational results.