Full metadata record
DC FieldValueLanguage
dc.contributor.authorKononov, Alexander V.en_US
dc.contributor.authorLin, Bertrand M. T.en_US
dc.date.accessioned2014-12-08T15:07:08Z-
dc.date.available2014-12-08T15:07:08Z-
dc.date.issued2010-04-01en_US
dc.identifier.issn1094-6136en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s10951-009-0151-7en_US
dc.identifier.urihttp://hdl.handle.net/11536/5590-
dc.description.abstractThis paper studies the minimization of total weighted completion time in the relocation problem on a single machine. The relocation problem, formulated from an area redevelopment project, can be treated as a resource-constrained scheduling problem. In this paper, we show four special cases to be NP-hard in the strong sense. Problem equivalence between the unit-weighted case and the UET (unit-execution-time) case is established. For two further restricted special cases, we present a polynomial time approximation algorithm and show its performance ratio to be 2.en_US
dc.language.isoen_USen_US
dc.subjectRelocation problemen_US
dc.subjectResource-constrained schedulingen_US
dc.subjectNP-hardnessen_US
dc.subjectApproximation algorithmen_US
dc.titleMinimizing the total weighted completion time in the relocation problemen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s10951-009-0151-7en_US
dc.identifier.journalJOURNAL OF SCHEDULINGen_US
dc.citation.volume13en_US
dc.citation.issue2en_US
dc.citation.spage123en_US
dc.citation.epage129en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000274959700002-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. 000274959700002.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.