DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lee, In-Soo | - |
dc.contributor.advisor | 이인수 | - |
dc.contributor.author | Song, Seong-Soo | - |
dc.contributor.author | 송성수 | - |
dc.date.accessioned | 2011-12-14T05:59:47Z | - |
dc.date.available | 2011-12-14T05:59:47Z | - |
dc.date.issued | 1992 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=60234&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/44542 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 경영과학과, 1992.2, [ v, 65 p. ] | - |
dc.description.abstract | We examine a one-machine scheduling problem to minimize the sum of weighted completion times subject to deadline constraints. Since this problem was proved to be NP-complete, most current researches have been focused on dominant lower bounds and effective precedence conditions that can be used in the framework of a branch and bound approach. In this thesis, the dominance relations among several lower and upper bounds are represented clearly by schedule graphs. An existing decomposition rule is computationally experimented. Based on the observation, blockwise heuristics are devised to improve the efficiency of branch and bound algorithm rithms for large problems. Finally, we show that a branch and bound algorithm may be improved by excluding some of the popular precedence conditions and incorporating a dominance property between nodes. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | One-machine scheduling problem with deadlines to minimize total weighted completion times | - |
dc.title.alternative | 납기제약하에서 총가중완성시간을 최소화하는 단일기계 일정계획 문제 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 60234/325007 | - |
dc.description.department | 한국과학기술원 : 경영과학과, | - |
dc.identifier.uid | 000901259 | - |
dc.contributor.localauthor | Lee, In-Soo | - |
dc.contributor.localauthor | 이인수 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.