DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Dong-Geun | ko |
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.contributor.author | Lee, Taesik | ko |
dc.date.accessioned | 2013-03-12T17:38:24Z | - |
dc.date.available | 2013-03-12T17:38:24Z | - |
dc.date.created | 2012-11-07 | - |
dc.date.created | 2012-11-07 | - |
dc.date.issued | 2012-06 | - |
dc.identifier.citation | INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, v.11, no.2, pp.202 - 214 | - |
dc.identifier.issn | 1598-7248 | - |
dc.identifier.uri | http://hdl.handle.net/10203/103037 | - |
dc.description.abstract | We consider a public health-care facility location problem in which there are two types of public health-care facilities: public hospitals and health centers. A public hospital provides both hospital services and homecare services, while a health center provides only homecare service. We focus on the problem of determining locations of public hospitals and health centers and allocating patients to the facilities with the objective of minimizing total construction cost for the public health-care facilities. We present an integer programming formulation for the problem, and develop two types of heuristics, based on priority rules and an approximate mathematical formulation. Results of a series of computational experiments on a number of problem instances show that the algorithms give good solutions in a reasonable computation time. | - |
dc.language | English | - |
dc.publisher | 대한산업공학회 | - |
dc.title | Heuristics for locating two types of public health-care facilities | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 11 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 202 | - |
dc.citation.endingpage | 214 | - |
dc.citation.publicationname | INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.localauthor | Lee, Taesik | - |
dc.contributor.nonIdAuthor | Kim, Dong-Geun | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.