Please use this identifier to cite or link to this item:
https://repository.iimb.ac.in/handle/2074/10030
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lingaraj, B P | en_US |
dc.contributor.author | Wolfe, Harvey | en_US |
dc.date.accessioned | 2019-08-20T11:16:28Z | - |
dc.date.available | 2019-08-20T11:16:28Z | - |
dc.date.issued | 1978 | - |
dc.identifier.uri | http://repository.iimb.ac.in/handle/2074/10030 | - |
dc.description.abstract | A linear programming model is formulated for optimizing the design of a tire plant. The determination of process capacities, the amounts of the various types of equipment, and the time-phasing of their acquisition constitutes facility design in this study. The large-scale linear program is decomposed into several subproblems to induce computational feasibility. Application of a linear programming code to these subproblems may yield a noninteger, optimum solution. Available integer programming codes can handle only very small problems. A heuristic method that exploits the special structure of the model is presented in this paper. The methodology is applied to the design of a new tire plant. | |
dc.language.iso | en_US | en_US |
dc.publisher | Taylor and Francis | |
dc.relation.ispartof | INFORM: Information Systems and Operational Research | en_US |
dc.subject | Tyre industry | - |
dc.subject | Linear programming | - |
dc.subject | Heuristic method | - |
dc.title | A Heuristic method for obtaining an integer solution to a facility design optimization problem | en_US |
dc.type | Journal Article | en_US |
dc.identifier.doi | 10.1080/03155986.1978.11731699 | - |
dc.pages | 171-182p. | en_US |
dc.vol.no | Vol.16 | - |
dc.issue.no | Iss.2 | - |
dc.journal.name | INFORM: Information Systems and Operational Research | - |
Appears in Collections: | 1974-1979 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Lingaraj_INFOR_1978_Vol.16_Iss.2.pdf | 656.04 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.