Design of Material Flow Networks in Manufacturing Facilities
| dc.contributor.author | Herrmann, Jeffrey W. | en_US |
| dc.contributor.author | Ioannou, George | en_US |
| dc.contributor.author | Minis, Ioannis | en_US |
| dc.contributor.author | Nagi, R. | en_US |
| dc.contributor.author | Proth, J.M. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:56:47Z | |
| dc.date.available | 2007-05-23T09:56:47Z | |
| dc.date.issued | 1994 | en_US |
| dc.description.abstract | In this paper we consider the design of material handling flow paths in a discrete parts manufacturing facility. A fixed-charge capacitated network design model is presented and two efficient heuristics are proposed to determine near-optimal solutions to the resulting NP- hard problem. The heuristics are tested against an implicit enumeration scheme used to obtain optimal solutions for small examples. For more realistic cases, the solutions of the heuristics are compared to lower bounds obtained by either the linear programming relaxation of the mixed integer program, or an iterative dual ascent algorithm. The results obtained indicate that the heuristics provide good solutions in reasonable time on the average. The proposed methodology is applied to design the flow paths of an existing manufacturing facility. The role of the flow path network problem in the integrated shop design is also discussed. | en_US |
| dc.format.extent | 1138839 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/5524 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1994-50 | en_US |
| dc.subject | algorithms | en_US |
| dc.subject | manufacturing | en_US |
| dc.subject | plant layout | en_US |
| dc.subject | Manufacturing Systems | en_US |
| dc.title | Design of Material Flow Networks in Manufacturing Facilities | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1