NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Comparison of heuristic methods for reliability optimization of series-parallel systems
| dc.creator | Lee, Hsiang | |
| dc.date.accessioned | 2012-06-07T23:20:42Z | |
| dc.date.available | 2012-06-07T23:20:42Z | |
| dc.date.created | 2003 | |
| dc.date.issued | 2003 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-2003-THESIS-L435 | |
| dc.description | Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item. | en |
| dc.description | Includes bibliographical references (leaves 28-29). | en |
| dc.description | Issued also on microfiche from Lange Micrographics. | en |
| dc.description.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. | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.publisher | Texas A&M University | |
| dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
| dc.subject | industrial engineering. | en |
| dc.subject | Major industrial engineering. | en |
| dc.title | Comparison of heuristic methods for reliability optimization of series-parallel systems | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | industrial engineering | en |
| thesis.degree.name | M.S. | en |
| thesis.degree.level | Masters | en |
| dc.type.genre | thesis | en |
| dc.type.material | text | en |
| dc.format.digitalOrigin | reformatted digital | en |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.