完整後設資料紀錄
DC 欄位語言
dc.contributor.authorKononov, A. V.en_US
dc.contributor.authorLin, B. M. T.en_US
dc.date.accessioned2014-12-08T15:15:20Z-
dc.date.available2014-12-08T15:15:20Z-
dc.date.issued2006-12-01en_US
dc.identifier.issn1572-5286en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.disopt.2006.06.003en_US
dc.identifier.urihttp://hdl.handle.net/11536/11508-
dc.description.abstractThe relocation problem was formulated from a public housing project. In its basic form, a set of buildings needed to be torn down and erected by a single working crew. Given a fixed budget, the relocation problem seeks to determine a feasible reconstruction sequence of the old buildings. This problem has been shown to be mathematically equivalent to the classical two-machine flowshop of makespan minimization. In this paper, we consider a variant where multiple working crews are available for the redevelopment project. Most of our results center on the situations where all buildings require the same redevelopment time. We first present a strong NP-hardness proof for the case with two working crews. Then, we give a negative result about the approximability of the studied problem. Approximation algorithms and associated performance-ratio analysis are designed for the cases with unbounded as well as bounded numbers of machines. (c) 2006 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectpublic housing projecten_US
dc.subjectjob schedulingen_US
dc.subjectresource constraintsen_US
dc.subjectparallel machinesen_US
dc.subjectNP-hardnessen_US
dc.subjectapproximationen_US
dc.titleOn relocation problems with multiple identical working crewsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.disopt.2006.06.003en_US
dc.identifier.journalDISCRETE OPTIMIZATIONen_US
dc.citation.volume3en_US
dc.citation.issue4en_US
dc.citation.spage366en_US
dc.citation.epage379en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000242965400008-
dc.citation.woscount1-
顯示於類別:期刊論文


文件中的檔案:

  1. 000242965400008.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。