Soegiharto, Stefanus (2003) Formulating a Mixed Integer Programming Model to Solve Multiple Machine Plant Location Problems. In: Proceedings 2nd National Industrial Engineering Conference. Industrial Engineering in a competitive and borderless world : Success through Business system integration, 9-11 Oktober 2003, University of Surabaya.
Preview |
PDF
Soegiharto_Formulating_Abstrak_2003.pdf - Published Version Download (55kB) | Preview |
![[thumbnail of Soegiharto_Formulating_2003.pdf]](/style/images/fileicons/application_pdf.png) |
PDF
Soegiharto_Formulating_2003.pdf - Published Version Restricted to Registered users only Download (451kB) | Request a copy |
Abstract
The configuration of logistic networks may involve issue relating to plant locations. Indeed, the classic plant allocation problems have been investigated by many researchers over the years. However, certain practical issues in plant location problems remain uninvestigated and require further research. This paper describes one variant of multiple machines plant location problem and uses mixed integer programming to formulate it. Finally, this paper presents a real world plant location problem which was worked on at a timber cutting company
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Plant location, multiple machines, mixed integer programming |
| Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management |
| Divisions: | Faculty of Engineering > Department of Industrial Engineering |
| Depositing User: | Eko Setiawan 194014 |
| Date Deposited: | 14 Mar 2012 07:25 |
| Last Modified: | 30 Mar 2012 04:05 |
| URI: | http://repository.ubaya.ac.id/id/eprint/192 |
Actions (login required)
 |
View Item |
