| Article ID: | iaor19972007 |
| Country: | Turkey |
| Volume: | 8 |
| Issue: | 1 |
| Start Page Number: | 25 |
| End Page Number: | 37 |
| Publication Date: | May 1996 |
| Journal: | Transactions on Operational Research |
| Authors: | Kandiller Levent |
| Keywords: | optimization, programming: integer |
In the design of cell manufacturing, the problem of identifying the vest manufacturing cell is encountered when concentrating on one manufacturing cell. In this paper, manufacturing systems are modeled by a hypergraph and the problem of identifying the vest manufacturing cell is formulated on it. It is proved that this problem can be solved in polynomial time in the region defined by the constraints, for a special case generated by the objective function. Results of an experimental analysis are summarized.