{"title":"Generalized Ng–Kundu–Chan model of adaptive progressive Type‐II censoring and related inference","authors":"Anja Bettina Schmiedt, Erhard Cramer","doi":"10.1002/nav.22152","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":49772,"journal":{"name":"Naval Research Logistics","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/nav.22152","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
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.
期刊介绍:
Submissions that are most appropriate for NRL are papers addressing modeling and analysis of problems motivated by real-world applications; major methodological advances in operations research and applied statistics; and expository or survey pieces of lasting value. Areas represented include (but are not limited to) probability, statistics, simulation, optimization, game theory, quality, scheduling, reliability, maintenance, supply chain, decision analysis, and combat models. Special issues devoted to a single topic are published occasionally, and proposals for special issues are welcomed by the Editorial Board.