Full metadata record
DC FieldValueLanguage
dc.contributor.authorLi, HLen_US
dc.contributor.authorHsieh, MCen_US
dc.date.accessioned2014-12-08T15:20:27Z-
dc.date.available2014-12-08T15:20:27Z-
dc.date.issued1998-03-01en_US
dc.identifier.issn0265-8135en_US
dc.identifier.urihttp://hdl.handle.net/11536/14546-
dc.description.abstractMost facility-layout problems are at present solved by heuristic methods, which are not suitable for treating layout problems if some facilities need to be placed together. In this paper we add the constraints of clustering facilities and thus propose an optimization model for facility-layout problems. The advantages of introducing clustering constraints are: first, they fit the more practical rationale of facility layouts; second, they can help improve the computational efficiency owing to the reduction in nonoverlapping constraints among the facilities.en_US
dc.language.isoen_USen_US
dc.titleSolving facility-layout optimization problems with clustering constraintsen_US
dc.typeArticleen_US
dc.identifier.journalENVIRONMENT AND PLANNING B-PLANNING & DESIGNen_US
dc.citation.volume25en_US
dc.citation.issue2en_US
dc.citation.spage299en_US
dc.citation.epage308en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000072693200010-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. 000072693200010.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.