One-machine scheduling problem with deadlines to minimize total weighted completion times = 납기제약하에서 총가중완성시간을 최소화하는 단일기계 일정계획 문제

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 173
  • Download : 0
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.
Advisors
Lee, In-Sooresearcher이인수researcher
Description
한국과학기술원 : 경영과학과,
Publisher
한국과학기술원
Issue Date
1992
Identifier
60234/325007 / 000901259
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 경영과학과, 1992.2, [ v, 65 p. ]

URI
http://hdl.handle.net/10203/44542
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=60234&flag=dissertation
Appears in Collection
MG-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0