Pub Date : 2016-02-01DOI: 10.1080/0740817X.2015.1133941
S. Tseng, Nan-Jung Hsu, Yi-Chiao Lin
ABSTRACT To achieve a successful warranty management program, a good prediction of a product's field return rate during the warranty period is essential. This study aims to make field return rate predictions for a particular scenario, the one where multiple products have a similar design and discrete-type laboratory data together with continuous-type field data is available for each product. We build a hierarchical model to link the laboratory and field data on failure. The efficient sharing of information among products means that the proposed method generally provides a more stable laboratory summary for each individual product, especially for those cases with few or even no failures during the laboratory testing stage. Furthermore, a real case study is used to verify the proposed method. It is shown that the proposed method provides a better connection between laboratory reliability and field reliability, and this leads to a significant improvement in the estimated field return rate.
{"title":"Joint modeling of laboratory and field data with application to warranty prediction for highly reliable products","authors":"S. Tseng, Nan-Jung Hsu, Yi-Chiao Lin","doi":"10.1080/0740817X.2015.1133941","DOIUrl":"https://doi.org/10.1080/0740817X.2015.1133941","url":null,"abstract":"ABSTRACT To achieve a successful warranty management program, a good prediction of a product's field return rate during the warranty period is essential. This study aims to make field return rate predictions for a particular scenario, the one where multiple products have a similar design and discrete-type laboratory data together with continuous-type field data is available for each product. We build a hierarchical model to link the laboratory and field data on failure. The efficient sharing of information among products means that the proposed method generally provides a more stable laboratory summary for each individual product, especially for those cases with few or even no failures during the laboratory testing stage. Furthermore, a real case study is used to verify the proposed method. It is shown that the proposed method provides a better connection between laboratory reliability and field reliability, and this leads to a significant improvement in the estimated field return rate.","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"48 1","pages":"710 - 719"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1133941","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59754428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1080/0740817X.2015.1027457
O. Solyalı, Meltem Denizel, Haldun Süral
ABSTRACT This study considers the serial lot sizing problem with backlogging in two-level supply chains to determine when and how much to order at a warehouse and ship to a retailer over a T-period planning horizon so that the external known demand occurring at the retailer is satisfied and the total cost at all levels is minimized. In particular, the uncapacitated two-level serial lot sizing problem with backlogging and the two-level serial lot sizing problem with cargo capacity and backlogging are formulated using effective shortest-path network representations, which define the convex hull of their feasible solutions. These representations lead to efficient algorithms with O(T3) time for the uncapacitated problem and O(T6) time for the capacitated problem. Furthermore, a tight reformulation with O(T3) variables and O(T2) constraints (resp. O(T6) variables and O(T5) constraints) is proposed for the uncapacitated (resp. capacitated) problem.
{"title":"Effective network formulations for lot sizing with backlogging in two-level serial supply chains","authors":"O. Solyalı, Meltem Denizel, Haldun Süral","doi":"10.1080/0740817X.2015.1027457","DOIUrl":"https://doi.org/10.1080/0740817X.2015.1027457","url":null,"abstract":"ABSTRACT This study considers the serial lot sizing problem with backlogging in two-level supply chains to determine when and how much to order at a warehouse and ship to a retailer over a T-period planning horizon so that the external known demand occurring at the retailer is satisfied and the total cost at all levels is minimized. In particular, the uncapacitated two-level serial lot sizing problem with backlogging and the two-level serial lot sizing problem with cargo capacity and backlogging are formulated using effective shortest-path network representations, which define the convex hull of their feasible solutions. These representations lead to efficient algorithms with O(T3) time for the uncapacitated problem and O(T6) time for the capacitated problem. Furthermore, a tight reformulation with O(T3) variables and O(T2) constraints (resp. O(T6) variables and O(T5) constraints) is proposed for the uncapacitated (resp. capacitated) problem.","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"48 1","pages":"146 - 157"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1027457","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59750058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1080/0740817X.2015.1056390
N. Boysen, Dirk Briskorn, Simon Emde
ABSTRACT This article treats a scheduling problem where timely departures of vehicles executing Just-In-Time (JIT) deliveries between a single supplier and a single receiver along with the assignment of supplies to vehicles are to be determined. This problem, for instance, arises in the automotive industry where parts are to be delivered JIT from a central distribution center to a car manufacturer. We define different subproblems and provide an analysis of computational complexity along with suitable solution procedures. Furthermore, we apply these procedures to an industry case, so that managerial implications are revealed; e.g., with regard to the impact of standardized containers on delivery costs.
{"title":"Just-in-time vehicle scheduling with capacity constraints","authors":"N. Boysen, Dirk Briskorn, Simon Emde","doi":"10.1080/0740817X.2015.1056390","DOIUrl":"https://doi.org/10.1080/0740817X.2015.1056390","url":null,"abstract":"ABSTRACT This article treats a scheduling problem where timely departures of vehicles executing Just-In-Time (JIT) deliveries between a single supplier and a single receiver along with the assignment of supplies to vehicles are to be determined. This problem, for instance, arises in the automotive industry where parts are to be delivered JIT from a central distribution center to a car manufacturer. We define different subproblems and provide an analysis of computational complexity along with suitable solution procedures. Furthermore, we apply these procedures to an industry case, so that managerial implications are revealed; e.g., with regard to the impact of standardized containers on delivery costs.","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"48 1","pages":"134 - 145"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1056390","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59750757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1080/0740817X.2015.1078523
Mark M. Nejad, Lena Mashayekhy, R. Chinnam, A. Phillips
ABSTRACT The development of efficient algorithms for vehicle routing on time-dependent networks is one of the major challenges in routing under intelligent transportation systems. Existing vehicle routing navigation systems, whether built-in or portable, lack the ability to rely on online servers. Such systems must compute the route in a stand-alone mode with limited hardware processing/memory capacity given an origin/destination pair and departure time. In this article, we propose a computationally efficient, yet effective, hierarchical algorithm to solve the time-dependent shortest path problem. Our proposed algorithm exploits community-based hierarchical representations of road networks, and it recursively reduces the search space in each level of the hierarchy by using our proposed search strategy algorithm. Our proposed algorithm is efficient in terms of finding shortest paths in milliseconds for large-scale road networks while eliminating the need to store preprocessed shortest paths, shortcuts, lower bounds, etc. We demonstrate the performance of the proposed algorithm using data from Detroit, New York, and San Francisco road networks.
{"title":"Hierarchical time-dependent shortest path algorithms for vehicle routing under ITS","authors":"Mark M. Nejad, Lena Mashayekhy, R. Chinnam, A. Phillips","doi":"10.1080/0740817X.2015.1078523","DOIUrl":"https://doi.org/10.1080/0740817X.2015.1078523","url":null,"abstract":"ABSTRACT The development of efficient algorithms for vehicle routing on time-dependent networks is one of the major challenges in routing under intelligent transportation systems. Existing vehicle routing navigation systems, whether built-in or portable, lack the ability to rely on online servers. Such systems must compute the route in a stand-alone mode with limited hardware processing/memory capacity given an origin/destination pair and departure time. In this article, we propose a computationally efficient, yet effective, hierarchical algorithm to solve the time-dependent shortest path problem. Our proposed algorithm exploits community-based hierarchical representations of road networks, and it recursively reduces the search space in each level of the hierarchy by using our proposed search strategy algorithm. Our proposed algorithm is efficient in terms of finding shortest paths in milliseconds for large-scale road networks while eliminating the need to store preprocessed shortest paths, shortcuts, lower bounds, etc. We demonstrate the performance of the proposed algorithm using data from Detroit, New York, and San Francisco road networks.","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"48 1","pages":"158 - 169"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1078523","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59752224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-01-29DOI: 10.1080/0740817X.2015.1125041
B. Liu, M. Xie, W. Kuo
ABSTRACT This article presents certain new approaches to the reliability modeling of systems subject to shared loads. It is assumed that components in the system degrade continuously through an additive impact under load. The reliability assessment of such systems is often complicated by the fact that both the arriving load and the failure of components influence the degradation of the surviving components in a complex manner. The proposed approaches seek to ease this problem, by first deriving the time to prior failures and the arrival of random loads and then determining the number of failed components. Two separate models capable of analyzing system reliability as well as arriving at system maintenance and design decisions are proposed. The first considers a constant load and the other a cumulative load. A numerical example is presented to illustrate the effectiveness of the proposed models.
{"title":"Reliability modeling and preventive maintenance of load-sharing systemswith degrading components","authors":"B. Liu, M. Xie, W. Kuo","doi":"10.1080/0740817X.2015.1125041","DOIUrl":"https://doi.org/10.1080/0740817X.2015.1125041","url":null,"abstract":"ABSTRACT This article presents certain new approaches to the reliability modeling of systems subject to shared loads. It is assumed that components in the system degrade continuously through an additive impact under load. The reliability assessment of such systems is often complicated by the fact that both the arriving load and the failure of components influence the degradation of the surviving components in a complex manner. The proposed approaches seek to ease this problem, by first deriving the time to prior failures and the arrival of random loads and then determining the number of failed components. Two separate models capable of analyzing system reliability as well as arriving at system maintenance and design decisions are proposed. The first considers a constant load and the other a cumulative load. A numerical example is presented to illustrate the effectiveness of the proposed models.","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"48 1","pages":"699 - 709"},"PeriodicalIF":0.0,"publicationDate":"2016-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1125041","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59753913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-01-28DOI: 10.1080/0740817X.2015.1125042
M. Mestres, Josep Estadella, J. A. Fernández
This work has been partially financed by the Ministerio de Ciencia e Innovaci´on (Ref: MTM2012- 33236) and the Ag`encia de Gesti´o d’Ajuts Universitaris i de Recerca (AGAUR), Generalitat de Catalunya (Ref: 2014SGR551)
这项工作的部分资金来自加拿大创新部（参考号：MTM2012-33236）和加泰罗尼亚综合大学的Agência de Gesti´o d’Ajuts Universitaris i de Recerca（AGAUR）（参考编号：2014SGR551）
{"title":"Signal Interpretation in Hotelling's T2 Control Chart for Compositional Data","authors":"M. Mestres, Josep Estadella, J. A. Fernández","doi":"10.1080/0740817X.2015.1125042","DOIUrl":"https://doi.org/10.1080/0740817X.2015.1125042","url":null,"abstract":"This work has been partially financed by the Ministerio de Ciencia e Innovaci´on (Ref: MTM2012- \u000033236) and the Ag`encia de Gesti´o d’Ajuts Universitaris i de Recerca (AGAUR), Generalitat de \u0000Catalunya (Ref: 2014SGR551)","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1125042","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59754007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-01-28DOI: 10.1080/0740817X.2015.1126002
Dong Ding, F. Tsung, Jian Li
ABSTRACT Conventional statistical process control tools target either continuous or categorical data but seldom both at the same time. However, mixed-type data consisting of both continuous and categorical observations are becoming more common in modern manufacturing processes and service management. However, they cannot be analyzed using traditional methods. By assuming that there is a latent continuous variable that determines the attribute levels of a categorical variable, the ordinal information among the attribute levels can be exploited. This enables us to simultaneously describe and monitor continuous and categorical data in a unified framework of standardized ranks, based on which a multivariate exponentially weighted moving average control chart is proposed. This control chart specializes in detecting location shifts in continuous data and in latent continuous distributions of categorical data. Numerical simulations show that our proposed chart can efficiently detect location shifts and is robust to various distributions.
{"title":"Rank-based process control for mixed-type data","authors":"Dong Ding, F. Tsung, Jian Li","doi":"10.1080/0740817X.2015.1126002","DOIUrl":"https://doi.org/10.1080/0740817X.2015.1126002","url":null,"abstract":"ABSTRACT Conventional statistical process control tools target either continuous or categorical data but seldom both at the same time. However, mixed-type data consisting of both continuous and categorical observations are becoming more common in modern manufacturing processes and service management. However, they cannot be analyzed using traditional methods. By assuming that there is a latent continuous variable that determines the attribute levels of a categorical variable, the ordinal information among the attribute levels can be exploited. This enables us to simultaneously describe and monitor continuous and categorical data in a unified framework of standardized ranks, based on which a multivariate exponentially weighted moving average control chart is proposed. This control chart specializes in detecting location shifts in continuous data and in latent continuous distributions of categorical data. Numerical simulations show that our proposed chart can efficiently detect location shifts and is robust to various distributions.","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"48 1","pages":"673 - 683"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1126002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59754606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-01-28DOI: 10.1080/0740817X.2015.1122255
R. Pascual, Gabriel Santelices, H. Liao, S. Maturana
ABSTRACT This article studies the positive and negative effects that fixed-term maintenance contracts may have on related decision-making. We present an original model to estimate such effects and select the optimal preventive maintenance intervals and contract terms for pieces of equipment that are serviced by an external party. In the context of the contract, the intention of each party is in general to maximize its own profit, which usually leads to unaligned interests and decisions. To resolve this issue, we propose incentive schemes to ensure the contract sustainability by achieving channel coordination between the client and its service vendor. Special focus is put on how the performed net-present-value analysis of both parties affects decision-making regarding equipment maintenance. Our model considers a new alternative of negotiating contracts with non-constant maintenance intervals. The proposed model helps to identify conditions that justify maintenance deferrals with their associated negligence, in terms of life cycle reduction and performance deterioration, when no channel coordination is promoted. Additionally, we present a simple procedure to settle an optimal contract duration, benefiting both parties. The proposed methodology is tested using a baseline case study from the literature. It illustrates how return-on-investment analysis may significantly impact optimal maintenance intervals during the contract for both parties. Accordingly, incentives need to be re-evaluated to achieve channel coordination. The suggested approach can be easily implemented in commercial spreadsheets, facilitating sensitivity analyses.
{"title":"Channel coordination on fixed-term maintenance outsourcing contracts","authors":"R. Pascual, Gabriel Santelices, H. Liao, S. Maturana","doi":"10.1080/0740817X.2015.1122255","DOIUrl":"https://doi.org/10.1080/0740817X.2015.1122255","url":null,"abstract":"ABSTRACT This article studies the positive and negative effects that fixed-term maintenance contracts may have on related decision-making. We present an original model to estimate such effects and select the optimal preventive maintenance intervals and contract terms for pieces of equipment that are serviced by an external party. In the context of the contract, the intention of each party is in general to maximize its own profit, which usually leads to unaligned interests and decisions. To resolve this issue, we propose incentive schemes to ensure the contract sustainability by achieving channel coordination between the client and its service vendor. Special focus is put on how the performed net-present-value analysis of both parties affects decision-making regarding equipment maintenance. Our model considers a new alternative of negotiating contracts with non-constant maintenance intervals. The proposed model helps to identify conditions that justify maintenance deferrals with their associated negligence, in terms of life cycle reduction and performance deterioration, when no channel coordination is promoted. Additionally, we present a simple procedure to settle an optimal contract duration, benefiting both parties. The proposed methodology is tested using a baseline case study from the literature. It illustrates how return-on-investment analysis may significantly impact optimal maintenance intervals during the contract for both parties. Accordingly, incentives need to be re-evaluated to achieve channel coordination. The suggested approach can be easily implemented in commercial spreadsheets, facilitating sensitivity analyses.","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"52 1","pages":"651 - 660"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1122255","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59753818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-01-19DOI: 10.1080/0740817X.2015.1126003
Soongeol Kwon, N. Gautam
ABSTRACT We consider a system of multiple parallel single-server queues where servers are heterogeneous with resources of different capacities and can be powered on or off while running at different speeds when they are powered on. In addition, we assume that application requests are heterogeneous with different workload distributions and resource requirements and the arrival, rates of request are time-varying. Managing such a heterogeneous, transient, and non-stationary system is a tremendous challenge. We take an unconventional approach, in that we force the queue lengths in each powered-on server to be time-stable (i.e., stationary). It allows the operators to guarantee performance and effectively monitor the system. We formulate a mixed-integer program to minimize energy costs while satisfying time-stability. Simulation results show that our suggested approach can stabilize queue length distributions and provide probabilistic performance guarantees on waiting times.
{"title":"Guaranteeing performance based on time-stability for energy-efficient data centers","authors":"Soongeol Kwon, N. Gautam","doi":"10.1080/0740817X.2015.1126003","DOIUrl":"https://doi.org/10.1080/0740817X.2015.1126003","url":null,"abstract":"ABSTRACT We consider a system of multiple parallel single-server queues where servers are heterogeneous with resources of different capacities and can be powered on or off while running at different speeds when they are powered on. In addition, we assume that application requests are heterogeneous with different workload distributions and resource requirements and the arrival, rates of request are time-varying. Managing such a heterogeneous, transient, and non-stationary system is a tremendous challenge. We take an unconventional approach, in that we force the queue lengths in each powered-on server to be time-stable (i.e., stationary). It allows the operators to guarantee performance and effectively monitor the system. We formulate a mixed-integer program to minimize energy costs while satisfying time-stability. Simulation results show that our suggested approach can stabilize queue length distributions and provide probabilistic performance guarantees on waiting times.","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"48 1","pages":"812 - 825"},"PeriodicalIF":0.0,"publicationDate":"2016-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1126003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59754655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-01-14DOI: 10.1080/0740817X.2015.1067736
Wenpo Huang, L. Shu, Junjie Cao, K. Tsui
Abstract In parallel to the conventional study of the distribution of the first time to signal, this paper investigates the probability distribution of the article Cumulative Sum (CUSUM) charting statistics based on a recurrence relationship. The probability distribution of the CUSUM statistic can not only provide statistical significance of observations against the null hypothesis of being in control but also facilitate the analysis of the CUSUM chart in the steady-state scenario. Both the conditional case (CUSUM chart without restarting) and the cyclical case (CUSUM chart with restarting) are considered. It is shown that the distribution of CUSUM charts both with and without restarting approaches a stationary distribution, independent of their initial values. We also show that the null steady-state distribution of the unbounded CUSUM chart previously reported in the literature is a special case of this article as the control limit approaches infinity.
{"title":"Probability distribution of CUSUM charting statistics","authors":"Wenpo Huang, L. Shu, Junjie Cao, K. Tsui","doi":"10.1080/0740817X.2015.1067736","DOIUrl":"https://doi.org/10.1080/0740817X.2015.1067736","url":null,"abstract":"Abstract In parallel to the conventional study of the distribution of the first time to signal, this paper investigates the probability distribution of the article Cumulative Sum (CUSUM) charting statistics based on a recurrence relationship. The probability distribution of the CUSUM statistic can not only provide statistical significance of observations against the null hypothesis of being in control but also facilitate the analysis of the CUSUM chart in the steady-state scenario. Both the conditional case (CUSUM chart without restarting) and the cyclical case (CUSUM chart with restarting) are considered. It is shown that the distribution of CUSUM charts both with and without restarting approaches a stationary distribution, independent of their initial values. We also show that the null steady-state distribution of the unbounded CUSUM chart previously reported in the literature is a special case of this article as the control limit approaches infinity.","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"48 1","pages":"324 - 332"},"PeriodicalIF":0.0,"publicationDate":"2016-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1067736","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"59751830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：