Calendar-based age replacement policy with dependent renewal cycles

被引:19
|
作者
Bajestani, Maliheh Aramon [1 ]
Banjevic, Dragan [1 ]
机构
[1] Univ Toronto, Dept Mech & Ind Engn, Toronto, ON, Canada
关键词
calendar-based age replacement policy; dependent renewal cycles; Markov renewal stochastic technique; utility industry; MODIFIED BLOCK-REPLACEMENT; MAINTENANCE POLICY; PREVENTIVE MAINTENANCE; SYSTEM; OPTIMIZATION;
D O I
10.1080/0740817X.2016.1163444
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this article, we introduce an age-based replacement policy in which the preventive replacements are restricted to specific calendar times. Under the new policy, the assets are renewed at failure or if their ages are greater than or equal to a replacement age at given calendar times, whichever occurs first. This policy is logistically applicable in industries such as utilities where there are large and geographically diverse populations of deteriorating assets with different installation times. Since preventive replacements are performed at fixed times, the renewal cycles are dependent random variables. Therefore, the classic renewal reward theorem cannot be directly applied. Using the theory of Markov chains with general state space and a suitably defined ergodic measure, we analyze the problem to find the optimal replacement age, minimizing the long-run expected cost per time unit. We further find the limiting distributions of the backward and forward recurrence times for this policy and show how our ergodic measure can be used to analyze more complicated policies. Finally, using a real data set of utility wood poles' maintenance records, we numerically illustrate some of our results including the importance of defining an appropriate ergodic measure in reducing the computational expense.
引用
收藏
页码:1016 / 1026
页数:11
相关论文
共 50 条
  • [1] Finding calendar-based periodic patterns
    Mahanta, Anjana Kakoti
    Mazarbhuiya, Fokrul Alom
    Baruah, Hemanta K.
    PATTERN RECOGNITION LETTERS, 2008, 29 (09) : 1274 - 1284
  • [2] Discovering calendar-based temporal association rules
    Li, YJ
    Ning, P
    Wang, XS
    Jajodia, S
    DATA & KNOWLEDGE ENGINEERING, 2003, 44 (02) : 193 - 218
  • [3] Advantages of determining the fertile window with the individualised Natural Cycles algorithm over calendar-based methods
    Kleinschmidt, Thea K.
    Bull, Jonathan R.
    Lavorini, Vincenzo
    Rowland, Simon P.
    Pearson, Jack T.
    Scherwitzl, Elina Berglund
    Scherwitzl, Raoul
    Danielsson, Kristina Gemzell
    EUROPEAN JOURNAL OF CONTRACEPTION AND REPRODUCTIVE HEALTH CARE, 2019, 24 (06): : 457 - 463
  • [4] Discovering calendar-based temporal association rules
    Li, YJ
    Ning, P
    Wang, XS
    Jajodia, S
    EIGHTH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS, 2001, : 111 - 118
  • [5] Mining calendar-based asynchronous periodical association rules with fuzzy calendar constraints
    Jiang, JY
    Lee, WJ
    Lee, SJ
    FUZZ-IEEE 2005: PROCEEDINGS OF THE IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS: BIGGEST LITTLE CONFERENCE IN THE WORLD, 2005, : 773 - 778
  • [6] Mining Calendar-Based Periodicities of Patterns in Temporal Data
    Dutta, Mala
    Mahanta, Anjana Kakoti
    PATTERN RECOGNITION AND MACHINE INTELLIGENCE, PROCEEDINGS, 2009, 5909 : 243 - 248
  • [7] Calendar-Based Graphics for Visualizing People's Daily Schedules
    Wang, Earo
    Cook, Dianne
    Hyndman, Rob J.
    JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2020, 29 (03) : 490 - 502
  • [8] An efficient algorithm to discover calendar-based temporal association rules
    Lee, WJ
    Jiang, JY
    Lee, SJ
    2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 3122 - 3127
  • [9] T-age Replacement Policy in Fuzzy Renewal Reward Processes
    Vajargah, Behrouz Fathi
    Ghasemalipour, Sara
    JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE-JMCS, 2012, 4 (03): : 402 - 410
  • [10] AGE REPLACEMENT POLICY WITH AGE-DEPENDENT MINIMAL REPAIR
    BERG, M
    BIENVENU, M
    CLEROUX, R
    INFOR, 1986, 24 (01) : 26 - 32