Redundancy optimization for a class of reliability systems with multiple-choice resource constraints = 자원의 다중선택이 허용되는 시스템 신뢰도의 최적화

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 363
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorSung, Chang-Sup-
dc.contributor.advisor성창섭-
dc.contributor.authorCho, Yong-Kwon-
dc.contributor.author조용권-
dc.date.accessioned2011-12-14T02:38:58Z-
dc.date.available2011-12-14T02:38:58Z-
dc.date.issued2000-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=157951&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/40497-
dc.description학위논문(박사) - 한국과학기술원 : 산업공학과, 2000.2, [ v, 85 p. ]-
dc.description.abstractThis thesis considers three reliability optimization problems for a class of reliability systems with multiple-choice constraints incorporated. Each problem is now described in detail. First, a redundancy optimization problem is considered in which multiple-choice and resource constraints are incorporated. The problem is expressed as a nonlinear integer programming problem which is characterized as an NP-hard problem. In the problem analysis, some solution properties are characterized and then used to derive an iterative solution space reduction procedure. The iterative reduction procedure is then used to derive an efficient branch-and- bound solution algorithm. Experimental tests are performed to show how dramatically the reduction procedure can work on removing any intermediately-found unnecessary decision variables from further consideration in solution search and also how efficient the proposed branch-and- bound method is. Second, a reliability optimization problem for a series system with multiple-choice constraints incorporated at each subsystem is considered to maximize the system reliability subject to the system budget. The problem is formulated as a nonlinear binary integer programming problem which is characterized as an NP-hard problem. In the problem analysis, some solution properties are characterized to reduce the solution space in advance. A branch-and-bound solution algorithm is then derived based on the reduced solution space to search for the optimal solution. The algorithm is tested for its efficiency with randomly generated numerical examples. Finally, a reliability optimization problem for a mixed series-parallel system is considered where the multiple-choice constraints are incorporated. The problem is also formulated as a nonlinear binary integer programming problem whose objective is to maximize the system reliability. A stage reduction procedure is proposed to solve the problem. A numerical example is solved to illustrate the procedure...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectBranch-and-Bound method-
dc.subjectSeries and mixed series-parallel system-
dc.subjectMultiple-choice-
dc.subjectReliability optimization-
dc.subjectDynamic programming-
dc.subject다이나믹 프로그래밍-
dc.subject분지한계법-
dc.subject직렬 시스템과 혼합 직렬-병령 시스템-
dc.subject다중선택 조건-
dc.subject신뢰도 최적화-
dc.titleRedundancy optimization for a class of reliability systems with multiple-choice resource constraints = 자원의 다중선택이 허용되는 시스템 신뢰도의 최적화-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN157951/325007-
dc.description.department한국과학기술원 : 산업공학과, -
dc.identifier.uid000935349-
dc.contributor.localauthorSung, Chang-Sup-
dc.contributor.localauthor성창섭-
Appears in Collection
IE-Theses_Ph.D.(박사논문)
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