rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Comparison of heuristic methods for reliability optimization of series-parallel systems
  name:
    name part: Lee, Hsiang.
    role:
      role term: creator
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: xx
    date issued: 2003
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    form: remote
    extent: vi, 30 leaves ; 28 cm.
  abstract: Three heuristics, the max-min approach, Nakagawa and Nakashima method, and Kim and Yum method, are considered for the redundancy allocation problem with series-parallel structures. The max-min approach can formulate the problem as an integer linear programming problem instead of an integer nonlinear problem. This paper presents a comparison between those methods from the standpoint of solution quality and computational complexity. The experimental results show that most of the time the max-min approach is superior to the Nakagawa and Nakashima method and Kim and Yum method for the series-parallel problem with multiple component choices in terms of solution quality, but an analysis of computational complexity shows that the max-min approach is inferior to other greedy heuristics.
  note: by Hsiang Lee.
  note: "Major subject: Industrial Engineering".
  note: Vita.
  note: Also available online.
  note: Issued also on microfiche from Lange Micrographics.
  note: M.S. Texas A&M University 2003
  note: Includes bibliographical references (leaves 28-29).
  subject:
    topic: Major industrial engineering
  identifier: https://hdl.handle.net/1969.1/ETD-TAMU-2003-THESIS-L435
  related item:
    location:
      url: https://hdl.handle.net/1969.1/ETD-TAMU-2003-THESIS-L435
  record info:
    record content source: TXA
    record creation date: 031119
    record change date: 20220103134349.0
    record identifier: in00001786487