Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/290098 
Year of Publication: 
2023
Citation: 
[Journal:] Naval Research Logistics (NRL) [ISSN:] 1520-6750 [Volume:] 71 [Issue:] 3 [Publisher:] John Wiley & Sons, Inc. [Place:] Hoboken, USA [Year:] 2023 [Pages:] 389-415
Publisher: 
John Wiley & Sons, Inc., Hoboken, USA
Abstract: 
The model of adaptive progressive Type-II censoring introduced by Ng et al. (2009)(referred to as Ng–Kundu–Chan model) is extended to allow switching from a given initial censoring plan ℛ to any arbitrary given plan 𝒮 of the same length. In this generalized model, the joint distribution of the failure times and the corresponding likelihood function is derived. It is illustrated that the computation of maximum likelihood and Bayesian estimates are along the same lines as for standard progressive Type-II censoring. However, the distributional properties of the estimators will usually be different since the censoring plan actually applied in the (generalized)Ng–Kundu–Chan model is random. As already mentioned in Cramer and Iliopoulos(2010), we directly show that the normalized spacings are independent and identically exponentially distributed. However, it turns out that the spacings themselves are generally dependent with mixtures of exponential distributions as marginals. These results are used to study linear estimators. Finally, we propose an algorithm for generating random numbers in the generalized Ng–Kundu–Chan model and present some simulation results. The results obtained also provide new findings in the original Ng–Kundu–Chan model; the corresponding implications are highlighted.
Subjects: 
adaptive progressive censoring
exponential distribution
likelihood inference
linear inference
Ng–Kundu–Chan model
progressive Type‐II censoring
spacings
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc-nd Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





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