Please use this identifier to cite or link to this item: https://doi.org/10.1109/24.765928
DC FieldValue
dc.titlePlanning step-stress life-test with a target acceleration-factor
dc.contributor.authorYeo, K.-P.
dc.contributor.authorTang, L.-C.
dc.date.accessioned2014-04-25T10:05:01Z
dc.date.available2014-04-25T10:05:01Z
dc.date.issued1999
dc.identifier.citationYeo, K.-P., Tang, L.-C. (1999). Planning step-stress life-test with a target acceleration-factor. IEEE Transactions on Reliability 48 (1) : 61-67. ScholarBank@NUS Repository. https://doi.org/10.1109/24.765928
dc.identifier.issn00189529
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/51864
dc.description.abstractA sequential approach is presented to plan a multiple-steps step-stress accelerated life test (SSALT) with type-I censoring so as to achieve a pre-specified acceleration factor. An initial optimal plan for a simple SSALT, where one not only has to determine the optimum hold-time under low stress but also the optimum low stress level, is obtained by solving a constrained non-linear program. A backward recursion scheme generates the subsequent optimal low-stress levels and hold-times for multiple-step SSALT. An illustration using a 3-step SSALT is presented. The relative efficiency of the 2-step and 3-step SSALT is investigated. A numerical example illustrates the method under 2-step and 3-step SSALT.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/24.765928
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentSTATISTICS & APPLIED PROBABILITY
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.doi10.1109/24.765928
dc.description.sourcetitleIEEE Transactions on Reliability
dc.description.volume48
dc.description.issue1
dc.description.page61-67
dc.description.codenIEERA
dc.identifier.isiut000080389600011
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.