Minimizing Work-in-Process and Material Handling in the Facilities Layout Problem
| dc.contributor.author | Fu, Michael C. | en_US |
| dc.contributor.author | Kaku, Bharat K. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:58:58Z | |
| dc.date.available | 2007-05-23T09:58:58Z | |
| dc.date.issued | 1995 | en_US |
| dc.description.abstract | We consider the plant layout problem for a job shop environment. This problem is generally treated as a quadratic assignment problem with the objective of minimizing material handling costs. In this paper we investigate conditions under which the quadratic assignment solution also minimizes average work-in-process. To get some initial insights, we model the plant as an open queueing network and show that under a certain set of assumptions, the problem of minimizing work-in-process reduces to the quadratic assignment problem. We then investigate via simulation the robustness of this result. We found that the relationship between material handling costs and average work-in-process holds under much more general conditions than are assumed in the analytical model. For those cases where the result does not hold, we have refined the model by developing a simple secondary measure which appears to work well in practice. | en_US |
| dc.format.extent | 745783 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/5629 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1995-41 | en_US |
| dc.subject | plant layout | en_US |
| dc.subject | quadratic assignment problem | en_US |
| dc.subject | queueing network models for manufacturing systems, | en_US |
| dc.title | Minimizing Work-in-Process and Material Handling in the Facilities Layout Problem | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1