<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing with OASIS Tables v3.0 20080202//EN" "journalpub-oasis3.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:oasis="http://docs.oasis-open.org/ns/oasis-exchange/table" xml:lang="en" dtd-version="3.0" article-type="research-article">
  <front>
    <journal-meta><journal-id journal-id-type="publisher">WES</journal-id><journal-title-group>
    <journal-title>Wind Energy Science</journal-title>
    <abbrev-journal-title abbrev-type="publisher">WES</abbrev-journal-title><abbrev-journal-title abbrev-type="nlm-ta">Wind Energ. Sci.</abbrev-journal-title>
  </journal-title-group><issn pub-type="epub">2366-7451</issn><publisher>
    <publisher-name>Copernicus Publications</publisher-name>
    <publisher-loc>Göttingen, Germany</publisher-loc>
  </publisher></journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.5194/wes-6-949-2021</article-id><title-group><article-title>Optimal scheduling of the next preventive <?xmltex \hack{\break}?> maintenance activity for a wind farm</article-title><alt-title>Optimal scheduling of the next preventive maintenance activity for a wind farm</alt-title>
      </title-group><?xmltex \runningtitle{Optimal scheduling of the next preventive maintenance activity for a wind farm}?><?xmltex \runningauthor{Q.~Yu et al.}?>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name><surname>Yu</surname><given-names>Quanjiang</given-names></name>
          <email>quanjiang.yu@gu.se</email>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name><surname>Patriksson</surname><given-names>Michael</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name><surname>Sagitov</surname><given-names>Serik</given-names></name>
          
        </contrib>
        <aff id="aff1"><institution>Department of Mathematical Sciences, Chalmers University of Technology and University of Gothenburg, 42 196 Gothenburg, Sweden</institution>
        </aff>
      </contrib-group>
      <author-notes><corresp id="corr1">Quanjiang Yu (quanjiang.yu@gu.se)</corresp></author-notes><pub-date><day>23</day><month>June</month><year>2021</year></pub-date>
      
      <volume>6</volume>
      <issue>3</issue>
      <fpage>949</fpage><lpage>959</lpage>
      <history>
        <date date-type="received"><day>27</day><month>November</month><year>2020</year></date>
           <date date-type="rev-request"><day>9</day><month>December</month><year>2020</year></date>
           <date date-type="rev-recd"><day>20</day><month>April</month><year>2021</year></date>
           <date date-type="accepted"><day>26</day><month>May</month><year>2021</year></date>
      </history>
      <permissions>
        <copyright-statement>Copyright: © 2021 Quanjiang Yu et al.</copyright-statement>
        <copyright-year>2021</copyright-year>
      <license license-type="open-access"><license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p></license></permissions><self-uri xlink:href="https://wes.copernicus.org/articles/6/949/2021/wes-6-949-2021.html">This article is available from https://wes.copernicus.org/articles/6/949/2021/wes-6-949-2021.html</self-uri><self-uri xlink:href="https://wes.copernicus.org/articles/6/949/2021/wes-6-949-2021.pdf">The full text article is available as a PDF file from https://wes.copernicus.org/articles/6/949/2021/wes-6-949-2021.pdf</self-uri>
      <abstract><title>Abstract</title>
    <p id="d1e98">A large part of the operational cost for a wind farm is due to the cost of  equipment maintenance, especially for offshore wind farms. How to reduce the maintenance cost, and hence increase profitability, is this article's focus. It presents a binary linear optimization model whose solution may inform the wind turbine owners about which components, and when, should undergo the next preventive maintenance (PM) replacements. The suggested short-term scheduling strategy takes into account eventual failure events of the multi-component system – in that after the failed system is repaired, the previously scheduled PM plan should be updated, assuming that the restored components are as good as new.</p>
    <p id="d1e101">The optimization algorithm of this paper, NextPM, is tested through numerical case studies applied to a four-component model of a wind turbine. The first study addresses the important case of a single component system, used for parameter calibration purposes. The second study analyses the case of seasonal variations of mobilization costs, as compared to the constant mobilization cost setting. Among other things, this analysis reveals a 35 % cost reduction achieved by the NextPM model, as compared to the pure corrective maintenance (CM) strategy. The third case study compares the NextPM model with another optimization model – the preventive maintenance scheduling problem with interval costs (PMSPIC), which was the major source of inspiration for this article. This comparison demonstrates that the NextPM model is accurate and much faster in terms of computational time.</p>
  </abstract>
    </article-meta>
  </front>
<body>
      

<sec id="Ch1.S1" sec-type="intro">
  <label>1</label><title>Introduction</title>
      <p id="d1e113">Wind energy is one of the lowest-priced renewable energy technologies available today; see <xref ref-type="bibr" rid="bib1.bibx7" id="text.1"/>. A large part of the total cost associated with wind turbines is due to operation and maintenance, amounting to 34 % for the fixed-bottom offshore wind turbines, according to <xref ref-type="bibr" rid="bib1.bibx11" id="text.2"/>. To reduce the maintenance cost, one can improve the design of the components, making them more reliable. One can also reduce the maintenance costs by means of an improved scheduling of the maintenance activities for still-functioning components depending on their current age. The latter task is the main concern of this paper, which proposes an optimization model for preventive maintenance (PM) scheduling of a wind turbine  or even a farm of wind turbines. Notice that, in this paper, by PM activities we do not mean the practice of regular inspection of the component's condition. Our concern is the optimal planning of preventive replacements of the components based on their current age.</p>
      <p id="d1e122">Typically, a maintenance model distinguishes between a corrective maintenance (CM) event, when a component should be attended after it breaks down, and a PM event, when one or several older components are renewed before they break down, see the recent survey <xref ref-type="bibr" rid="bib1.bibx8" id="paren.3"/>. An optimal PM scheduling is aimed at reducing the lost production due to the downtime caused by CM events.</p>
      <p id="d1e128">There is a multitude of papers devoted to the optimal PM scheduling for multi-component systems; see <xref ref-type="bibr" rid="bib1.bibx14" id="text.4"/>. The article <xref ref-type="bibr" rid="bib1.bibx6" id="text.5"/> proposes a joint optimization of the maintenance policy and the inspection interval for a multi-unit series system with economic dependence. It develops an algorithm aiming<?pagebreak page950?> at a maintenance policy for a multi-component system minimizing the maintenance cost, under the assumption that  one unit of the system is subject to condition monitoring, while for the other units only the age information is available. <xref ref-type="bibr" rid="bib1.bibx13" id="text.6"/> develop a method to quantify the uncertainty of the remaining life length, resulting in an effective condition-based maintenance approach to optimal scheduling.</p>
      <p id="d1e140">The article <xref ref-type="bibr" rid="bib1.bibx10" id="text.7"/> looks at opportunistic maintenance (OM), which is a special kind of a PM activity occurring at the time of a CM replacement: replacing still-functioning components together with the broken one may save some mobilization costs. OM activities are shown to be extremely beneficial for the offshore wind farms, due to the large mobilization costs.</p>
      <p id="d1e147">In <xref ref-type="bibr" rid="bib1.bibx9" id="text.8"/>, optimization models are developed to determine the optimal PM schedules in repairable and maintainable systems. They show that if mobilization costs are the same irrespective of the number of components to be attended, then multiple simultaneous PM activities become cost-effective. However, their optimization models are nonlinear and non-convex, which makes them computationally hard to solve; see Sect. 1.3 in <xref ref-type="bibr" rid="bib1.bibx1" id="text.9"/>.</p>
      <p id="d1e156">The preventive maintenance scheduling problem with interval costs (PMSPIC) model from <xref ref-type="bibr" rid="bib1.bibx5" id="text.10"/> was the major inspiration for this work. The main feature of the PMSPIC model is the idea of interval cost: given a time interval between two consecutive PM activities, the expected maintenance cost should take into account eventual breakdowns of components during this time interval. The PMSPIC model has a long computational time, which motivated us to build a new optimization model for PM scheduling of a wind turbine.</p>
      <p id="d1e162">In this paper, we build on the state of the art with a new algorithm, NextPM. Given the current ages of the key components of the system, NextPM computes the best time to perform the next maintenance activity and determines which components should be replaced at that time. The algorithm can be solved in 1 s and thus has a potential for being used as a key module in a maintenance scheduling app for wind turbines.</p>
      <p id="d1e165">The paper is organized as follows. Section <xref ref-type="sec" rid="Ch1.S2"/> presents a novel optimization model for maintenance scheduling of a multi-component system. In the context of wind farm maintenance, each wind turbine is viewed here as a system comprising multiple components such as the gearbox, power generator, rotor, and main bearing. Whenever one of the components is broken, the whole system stops functioning. After the broken component is replaced by a new one, the system resumes its function. It is assumed that at time 0 all components of the system are new and that the total lifespan of the system is <inline-formula><mml:math id="M1" display="inline"><mml:mi>T</mml:mi></mml:math></inline-formula> units of time. The model has a discrete time setting <inline-formula><mml:math id="M2" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>, 1, …, <inline-formula><mml:math id="M3" display="inline"><mml:mi>T</mml:mi></mml:math></inline-formula>, where the unit of time can be either a day, a month, or a year, depending on a concrete application; see <xref ref-type="bibr" rid="bib1.bibx2" id="text.11"/> for a maintenance scheduling with only 1 d ahead. In the same Sect. <xref ref-type="sec" rid="Ch1.S2"/>, the main result of the paper is summarized as Algorithm 1, aiming at an optimal PM schedule for the time period [<inline-formula><mml:math id="M4" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M5" display="inline"><mml:mi>T</mml:mi></mml:math></inline-formula>] with an arbitrary starting time <inline-formula><mml:math id="M6" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>∈</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>T</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. Figure <xref ref-type="fig" rid="Ch1.F1"/> gives a non-technical description of the algorithm.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F1" specific-use="star"><?xmltex \currentcnt{1}?><?xmltex \def\figurename{Figure}?><label>Figure 1</label><caption><p id="d1e244">Flow diagram of the optimization algorithm involving NextPM as a major step.</p></caption>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://wes.copernicus.org/articles/6/949/2021/wes-6-949-2021-f01.png"/>

      </fig>

      <p id="d1e254">The key ingredient of Algorithm 1, the NextPM optimization model, is carefully described in Sect. <xref ref-type="sec" rid="Ch1.S3"/>. Section <xref ref-type="sec" rid="Ch1.S4"/> contains several numerical studies that demonstrate the flexibility of our approach, its accuracy, and computational effectiveness. Finally, Sect. <xref ref-type="sec" rid="Ch1.S5"/> presents the main conclusions of the paper.</p>
</sec>
<sec id="Ch1.S2">
  <label>2</label><title>Optimal rescheduling algorithm</title>
      <p id="d1e271">Consider a system composed of <inline-formula><mml:math id="M7" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> components characterized by different life length distributions. For the component <inline-formula><mml:math id="M8" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>, it is assumed that its total life length <inline-formula><mml:math id="M9" display="inline"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is a random variable having a Weibull distribution with parameters (<inline-formula><mml:math id="M10" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M11" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>), so that the corresponding survival function is
          <disp-formula id="Ch1.E1" content-type="numbered"><label>1</label><mml:math id="M12" display="block"><mml:mrow><mml:mi>P</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&gt;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:msup><mml:mfenced open="(" close=")"><mml:mstyle scriptlevel="+1"><mml:mfrac><mml:mi>t</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mstyle></mml:mfenced><mml:mrow><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>t</mml:mi><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>n</mml:mi><mml:mo>;</mml:mo></mml:mrow></mml:math></disp-formula>
        see <xref ref-type="bibr" rid="bib1.bibx4" id="text.12"/> concerning the use of the Weibull distribution for the modeling of multi-component systems. The means and variances of the component  life lengths are the following functions of the Weibull parameters:
          <disp-formula id="Ch1.E2" content-type="numbered"><label>2</label><mml:math id="M13" display="block"><mml:mtable rowspacing="0.2ex" class="split" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mi mathvariant="normal">Γ</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>+</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:msubsup><mml:mi mathvariant="italic">σ</mml:mi><mml:mi>j</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi mathvariant="italic">α</mml:mi><mml:mi>j</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup><mml:mi mathvariant="normal">Γ</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>+</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">2</mml:mn><mml:mrow><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mfenced><mml:mo>-</mml:mo><mml:msubsup><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>j</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>n</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
        Besides the Weibull parameters (<inline-formula><mml:math id="M14" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M15" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>), <inline-formula><mml:math id="M16" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M17" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula>, our optimization model requires the following parameters associated with various maintenance costs:
<inline-formula><mml:math id="M18" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the time-dependent mobilization cost for either a PM or CM activity, <inline-formula><mml:math id="M19" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M20" display="inline"><mml:mi>T</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M21" display="inline"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the CM cost of the component <inline-formula><mml:math id="M22" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M23" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula>, and <inline-formula><mml:math id="M24" display="inline"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the PM cost of the component <inline-formula><mml:math id="M25" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M26" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula>. The full set of the model parameters
<inline-formula><mml:math id="M27" display="inline"><mml:mrow><mml:mo mathvariant="italic">{</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M28" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>T</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:mi mathvariant="italic">λ</mml:mi><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> includes an extra parameter <inline-formula><mml:math id="M29" display="inline"><mml:mi mathvariant="italic">λ</mml:mi></mml:math></inline-formula> introduced in Sect. <xref ref-type="sec" rid="Ch1.S3.SS2"/> by Eq. (<xref ref-type="disp-formula" rid="Ch1.E11"/>).</p>
      <p id="d1e767">Suppose that the multi-component system is observed at some time <inline-formula><mml:math id="M30" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>∈</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>T</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, and the latest maintenance times of components <inline-formula><mml:math id="M31" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M32" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> are known to be <inline-formula><mml:math id="M33" display="inline"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, so that at the time <inline-formula><mml:math id="M34" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>, the <inline-formula><mml:math id="M35" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> components have the effective ages (<inline-formula><mml:math id="M36" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M37" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>). The NextPM optimization model described in Sect. <xref ref-type="sec" rid="Ch1.S3"/> has the input (<inline-formula><mml:math id="M38" display="inline"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M39" display="inline"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M40" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M41" display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula>), where <inline-formula><mml:math id="M42" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>∈</mml:mo><mml:mo>[</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>T</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is the end of the current planning period. The output of NextPM is a PM plan specifying the optimal time <inline-formula><mml:math id="M43" display="inline"><mml:mrow><mml:mi mathvariant="italic">τ</mml:mi><mml:mo>∈</mml:mo><mml:mo>[</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> of the next PM event, as well as the set of components <inline-formula><mml:math id="M44" display="inline"><mml:mrow><mml:mi mathvariant="script">P</mml:mi><mml:mo>⊂</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>n</mml:mi><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> which should be maintained at the time <inline-formula><mml:math id="M45" display="inline"><mml:mi mathvariant="italic">τ</mml:mi></mml:math></inline-formula>. In particular, the output <inline-formula><mml:math id="M46" display="inline"><mml:mrow><mml:mi mathvariant="italic">τ</mml:mi><mml:mo>=</mml:mo><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> means that no PM activity should be scheduled during the planning period [<inline-formula><mml:math id="M47" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:math></inline-formula>], implying that the set <inline-formula><mml:math id="M48" display="inline"><mml:mi mathvariant="script">P</mml:mi></mml:math></inline-formula> is empty.</p>
      <?pagebreak page951?><p id="d1e1045"><?xmltex \hack{\newpage}?>The NextPM model is the key module of the following Algorithm 1 aiming at the long-term PM scheduling until the end time <inline-formula><mml:math id="M49" display="inline"><mml:mi>T</mml:mi></mml:math></inline-formula>, at which the whole system is expected to be dismantled; see Fig. <xref ref-type="fig" rid="Ch1.F1"/> for a flow chart illustrating the major steps of Algorithm 1.</p>
      <p id="d1e1058"><?xmltex \hack{\begin{figure*}[t]}?><?xmltex \igopts{width=455.244094pt}?><inline-graphic xlink:href="https://wes.copernicus.org/articles/6/949/2021/wes-6-949-2021-g01.png"/><?xmltex \hack{\end{figure*}}?></p>
      <p id="d1e1067">Algorithm 1 relies on a rescheduling procedure, where each NextPM step covering <inline-formula><mml:math id="M50" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula> units of the planning time is accompanied by a NextOM module. The latter is a modification of the NextPM step (see Sect. <xref ref-type="sec" rid="Ch1.S3.SS5"/>), which addresses the possibility of a component failure before the planned PM, followed by an OM activity.</p>
</sec>
<sec id="Ch1.S3">
  <label>3</label><title>An optimal plan for the next preventive maintenance</title>
      <p id="d1e1092">This section sets up the optimization model NextPM, which is the key ingredient of Algorithm 1 summarized in Sect. <xref ref-type="sec" rid="Ch1.S2"/>. The optimization model PMSPIC of <xref ref-type="bibr" rid="bib1.bibx5" id="text.13"/> was a major motivation for NextPM, and we start by comparing these two approaches using Figs. <xref ref-type="fig" rid="Ch1.F2"/> and <xref ref-type="fig" rid="Ch1.F3"/>, which illustrate two different definitions of the objective functions for two optimization models in question.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F2" specific-use="star"><?xmltex \currentcnt{2}?><?xmltex \def\figurename{Figure}?><label>Figure 2</label><caption><p id="d1e1106">A flow diagram demonstrating how the PMSPIC calculates the objective function for a given feasible maintenance plan.</p></caption>
        <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://wes.copernicus.org/articles/6/949/2021/wes-6-949-2021-f02.png"/>

      </fig>

      <?xmltex \floatpos{h!}?><fig id="Ch1.F3" specific-use="star"><?xmltex \currentcnt{3}?><?xmltex \def\figurename{Figure}?><label>Figure 3</label><caption><p id="d1e1117">A flow diagram demonstrating how NextPM model calculates the objective function for a given feasible maintenance plan with <inline-formula><mml:math id="M51" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>.</p></caption>
        <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://wes.copernicus.org/articles/6/949/2021/wes-6-949-2021-f03.png"/>

      </fig>

      <p id="d1e1139">The main difference between PMSPIC and NextPM model is that while PMSPIC generates a maintenance plan for the whole lifetime of the wind turbine, the NextPM model produces an optimal schedule only for the next PM activity. To this end, PMSPIC looks into the total maintenance cost, while NextPM aims at minimizing the time average maintenance cost.</p>
<sec id="Ch1.S3.SS1">
  <label>3.1</label><title>NextPM model</title>
      <p id="d1e1149">The purpose of the NextPM model is to produce an optimal PM plan for the period [<inline-formula><mml:math id="M52" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:math></inline-formula>], where the planning time span <inline-formula><mml:math id="M53" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula> is chosen so that it is reasonable to expect at most one PM event during time <inline-formula><mml:math id="M54" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula>. For a given planning period <inline-formula><mml:math id="M55" display="inline"><mml:mrow><mml:mo>[</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo>]</mml:mo><mml:mo>⊂</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>T</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, an <inline-formula><mml:math id="M56" display="inline"><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> <italic>plan</italic> is defined as a collection (<inline-formula><mml:math id="M57" display="inline"><mml:mi mathvariant="bold-italic">z</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M58" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M59" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>) of vectors
<?xmltex \hack{\newpage}?><?xmltex \hack{\vspace*{-6mm}}?>

                <disp-formula specific-use="align"><mml:math id="M60" display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mo>=</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>j</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>

            with binary coordinates <inline-formula><mml:math id="M61" display="inline"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M62" display="inline"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>, which satisfy the following linear conditions:

                <disp-formula specific-use="align" content-type="numbered"><mml:math id="M63" display="block"><mml:mtable displaystyle="true"><mml:mlabeledtr id="Ch1.E3"><mml:mtd><mml:mtext>3</mml:mtext></mml:mtd><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:munderover><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr><mml:mlabeledtr id="Ch1.E4"><mml:mtd><mml:mtext>4</mml:mtext></mml:mtd><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≤</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>n</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr></mml:mtable></mml:math></disp-formula>

            For <inline-formula><mml:math id="M64" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, … <inline-formula><mml:math id="M65" display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula>, the equality <inline-formula><mml:math id="M66" display="inline"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> means that
according to the (<inline-formula><mml:math id="M67" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M68" display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula>) plan, component <inline-formula><mml:math id="M69" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> should undergo a PM replacement at time <inline-formula><mml:math id="M70" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>, provided no component failure during the time period [<inline-formula><mml:math id="M71" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:math></inline-formula>t]. In contrast, the equality <inline-formula><mml:math id="M72" display="inline"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> means that according to the (<inline-formula><mml:math id="M73" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M74" display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula>) plan, no PM activity should involve component <inline-formula><mml:math id="M75" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> during the time period [<inline-formula><mml:math id="M76" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:math></inline-formula>]. On the whole system level, the equality <inline-formula><mml:math id="M77" display="inline"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> means that according to the (<inline-formula><mml:math id="M78" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M79" display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula>) plan, at least one component should undergo a PM replacement at time <inline-formula><mml:math id="M80" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>, provided no component failure during the time period [<inline-formula><mml:math id="M81" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula>], and the equality <inline-formula><mml:math id="M82" display="inline"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> means that according to the (<inline-formula><mml:math id="M83" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M84" display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula>) plan, no PM activity is scheduled for the time period [<inline-formula><mml:math id="M85" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:math></inline-formula>].</p>
      <p id="d1e1829">The NextPM optimization model is built around the objective function:
            <disp-formula id="Ch1.E5" content-type="numbered"><label>5</label><mml:math id="M86" display="block"><mml:mtable class="split" rowspacing="0.2ex" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mrow><mml:mi>f</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msup><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:mfenced></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:munderover><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mfenced close="" open="("><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mn mathvariant="normal">1</mml:mn></mml:msubsup><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mfenced close=")" open=""><mml:mrow><mml:mo>+</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mo>+</mml:mo><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>n</mml:mi></mml:msubsup></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
          where <inline-formula><mml:math id="M87" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> stands for the mobilization cost and the terms <inline-formula><mml:math id="M88" display="inline"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> are the so-called interval costs defined in Sect. <xref ref-type="sec" rid="Ch1.S3.SS2"/>.  The objective function (Eq. <xref ref-type="disp-formula" rid="Ch1.E5"/>) can be viewed as the time average maintenance cost per time unit according to the (<inline-formula><mml:math id="M89" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M90" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>) plan (<inline-formula><mml:math id="M91" display="inline"><mml:mi mathvariant="bold-italic">z</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M92" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M93" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>).</p>
      <?pagebreak page952?><p id="d1e2053"><?xmltex \hack{\newpage}?>Let (<inline-formula><mml:math id="M94" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover></mml:math></inline-formula>, <inline-formula><mml:math id="M95" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover></mml:math></inline-formula>) be the solution to the linear optimization problem
            <disp-formula id="Ch1.E6" content-type="numbered"><label>6</label><mml:math id="M96" display="block"><mml:mrow><mml:mi mathvariant="normal">minimize</mml:mi><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>f</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msup><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:mfenced></mml:mrow></mml:math></disp-formula>
          over all (<inline-formula><mml:math id="M97" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M98" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>) plans subject to the linear constraints
            <disp-formula id="Ch1.E7" content-type="numbered"><label>7</label><mml:math id="M99" display="block"><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          where <inline-formula><mml:math id="M100" display="inline"><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> is defined in Sect. <xref ref-type="sec" rid="Ch1.S3.SS3"/> as the PM benefit for the component <inline-formula><mml:math id="M101" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> at time <inline-formula><mml:math id="M102" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>. Then the NextPM algorithm (<inline-formula><mml:math id="M103" display="inline"><mml:mi mathvariant="italic">τ</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M104" display="inline"><mml:mi mathvariant="script">N</mml:mi></mml:math></inline-formula>) computes the optimal time of the next PM by
<?xmltex \hack{\newpage}?><?xmltex \hack{\vspace*{-6mm}}?>
            <disp-formula id="Ch1.Ex3"><mml:math id="M105" display="block"><mml:mrow><mml:mi mathvariant="italic">τ</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="normal">min</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi mathvariant="normal">argmax</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msubsup><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:math></disp-formula>
          and determines the set of the components that should undergo the maintenance activities at time <inline-formula><mml:math id="M106" display="inline"><mml:mi mathvariant="italic">τ</mml:mi></mml:math></inline-formula> using
            <disp-formula id="Ch1.Ex4"><mml:math id="M107" display="block"><mml:mrow><mml:mi mathvariant="script">N</mml:mi><mml:mo>=</mml:mo><mml:mfenced open="{" close=""><mml:mtable class="array" columnalign="left left"><mml:mtr><mml:mtd><mml:mrow><mml:mfenced open="{" close="}"><mml:mrow><mml:mi>j</mml:mi><mml:mo>:</mml:mo><mml:msubsup><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mi mathvariant="italic">τ</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>n</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi mathvariant="normal">if</mml:mi><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi mathvariant="italic">τ</mml:mi><mml:mo>≤</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi mathvariant="normal">∅</mml:mi></mml:mtd><mml:mtd><mml:mrow><mml:mi mathvariant="normal">if</mml:mi><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi mathvariant="italic">τ</mml:mi><mml:mo>=</mml:mo><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mfenced></mml:mrow></mml:math></disp-formula></p><?xmltex \hack{\newpage}?>
</sec>
<?pagebreak page953?><sec id="Ch1.S3.SS2">
  <label>3.2</label><?xmltex \opttitle{Definition of modified interval costs $c_{{s,t}}^{{j}}$}?><title>Definition of modified interval costs <inline-formula><mml:math id="M108" display="inline"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula></title>
      <p id="d1e2414">Here we deal with the term <inline-formula><mml:math id="M109" display="inline"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> appearing in the objective function (Eq. <xref ref-type="disp-formula" rid="Ch1.E5"/>) of the optimization model NextPM. The main idea is to define <inline-formula><mml:math id="M110" display="inline"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> as the fixed PM cost <inline-formula><mml:math id="M111" display="inline"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> plus the expected additional costs due to eventual failures of the component <inline-formula><mml:math id="M112" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> occurring prior to the planned PM activity at time <inline-formula><mml:math id="M113" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>.</p>
      <p id="d1e2481">To this end, consider <inline-formula><mml:math id="M114" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> independent sequences of renewal times with a delay by letting <inline-formula><mml:math id="M115" display="inline"><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula>,
            <disp-formula id="Ch1.E8" content-type="numbered"><label>8</label><mml:math id="M116" display="block"><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mover><mml:mo movablelimits="false">=</mml:mo><mml:mi>d</mml:mi></mml:mover><mml:mfenced open="{" close="}"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>|</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&gt;</mml:mo><mml:mi>s</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          where <inline-formula><mml:math id="M117" display="inline"><mml:mover><mml:mo movablelimits="false">=</mml:mo><mml:mi>d</mml:mi></mml:mover></mml:math></inline-formula> means equality in distribution (conditional distribution in the above formula), and
            <disp-formula id="Ch1.E9" content-type="numbered"><label>9</label><mml:math id="M118" display="block"><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mover><mml:mo movablelimits="false">=</mml:mo><mml:mi>d</mml:mi></mml:mover><mml:msub><mml:mi>L</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi mathvariant="normal">for</mml:mi><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">3</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          assuming that the random variables (<inline-formula><mml:math id="M119" display="inline"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>) are mutually independent. Notice that in the important particular case <inline-formula><mml:math id="M120" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>, this definition simplifies, so that for each <inline-formula><mml:math id="M121" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>, the sequence <inline-formula><mml:math id="M122" display="inline"><mml:mrow><mml:mo mathvariant="italic">{</mml:mo><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:msub><mml:mo mathvariant="italic">}</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> describes a renewal process without a delay.</p>
      <p id="d1e2764">Treating <inline-formula><mml:math id="M123" display="inline"><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M124" display="inline"><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, … as the sequence of consecutive failure times of the component <inline-formula><mml:math id="M125" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>, put
            <disp-formula id="Ch1.E10" content-type="numbered"><label>10</label><mml:math id="M126" display="block"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>:=</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mi>E</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi mathvariant="normal">∞</mml:mi></mml:munderover><mml:msub><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mfenced open="{" close="}"><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≤</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:msub><mml:msub><mml:mi>G</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mfenced open="(" close=")"><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          where the cost functions
            <disp-formula id="Ch1.E11" content-type="numbered"><label>11</label><mml:math id="M127" display="block"><mml:mtable class="split" rowspacing="0.2ex" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msup><mml:mfenced open="(" close=")"><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mi>u</mml:mi><mml:mi>v</mml:mi></mml:mfrac></mml:mstyle></mml:mfenced><mml:mi mathvariant="italic">λ</mml:mi></mml:msup><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mn mathvariant="normal">0</mml:mn><mml:mo>≤</mml:mo><mml:mi>u</mml:mi><mml:mo>≤</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
          involve a new parameter <inline-formula><mml:math id="M128" display="inline"><mml:mrow><mml:mi mathvariant="italic">λ</mml:mi><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> assumed to be independent of <inline-formula><mml:math id="M129" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M130" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula>. The definition of the cost function (Eq. <xref ref-type="disp-formula" rid="Ch1.E11"/>) further develops the key idea of Sect. 5.1 in <xref ref-type="bibr" rid="bib1.bibx5" id="text.14"/>. It describes the additional cost implied by an eventual breakdown of component <inline-formula><mml:math id="M131" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> before the planned PM activity.</p>
      <p id="d1e3061">The expression (Eq. <xref ref-type="disp-formula" rid="Ch1.E11"/>) is suggested as a compromise between two extreme cases: a failure at the start of the planning period, <inline-formula><mml:math id="M132" display="inline"><mml:mrow><mml:mi>u</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>, and a failure just before the planned PM replacement, <inline-formula><mml:math id="M133" display="inline"><mml:mrow><mml:mi>u</mml:mi><mml:mo>=</mml:mo><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math id="M134" display="inline"><mml:mi>u</mml:mi></mml:math></inline-formula> is close to 0, then the failure at time <inline-formula><mml:math id="M135" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:math></inline-formula> will not change the PM plan, implying that the much smaller additional cost
            <disp-formula id="Ch1.E12" content-type="numbered"><label>12</label><mml:math id="M136" display="block"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>
          is the sum of the CM cost <inline-formula><mml:math id="M137" display="inline"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and the mobilization cost <inline-formula><mml:math id="M138" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> at time <inline-formula><mml:math id="M139" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>. On the other hand, if <inline-formula><mml:math id="M140" display="inline"><mml:mi>u</mml:mi></mml:math></inline-formula> is close to <inline-formula><mml:math id="M141" display="inline"><mml:mrow><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula>, then the additional cost
            <disp-formula id="Ch1.E13" content-type="numbered"><label>13</label><mml:math id="M142" display="block"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>
          is simply the difference between the CM and PM costs. For <inline-formula><mml:math id="M143" display="inline"><mml:mrow><mml:mi>u</mml:mi><mml:mo>∈</mml:mo><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, the expression on the right-hand side of Eq. (<xref ref-type="disp-formula" rid="Ch1.E11"/>) produces an additional cost which lies between the extreme values (Eqs. <xref ref-type="disp-formula" rid="Ch1.E12"/> and <xref ref-type="disp-formula" rid="Ch1.E13"/>). The role of the parameter <inline-formula><mml:math id="M144" display="inline"><mml:mi mathvariant="italic">λ</mml:mi></mml:math></inline-formula> is to control to what extent the proximity of the failure time to the planned PM time influences the extra costs. For example, if <inline-formula><mml:math id="M145" display="inline"><mml:mrow><mml:mi mathvariant="italic">λ</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> the intermediate cost is found by a linear extrapolation.</p>
</sec>
<sec id="Ch1.S3.SS3">
  <label>3.3</label><?xmltex \opttitle{Definition of~$D^{{j}}_{{s,t}}$}?><title>Definition of <inline-formula><mml:math id="M146" display="inline"><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula></title>
      <p id="d1e3327">The constraint (Eq. <xref ref-type="disp-formula" rid="Ch1.E7"/>) arises as a checkup step to ensure that a suggested PM at time <inline-formula><mml:math id="M147" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula> brings some  benefit, as compared to a simple strategy when no PM is performed. With the PM-free strategy, the total maintenance cost (including mobilization costs) for the component <inline-formula><mml:math id="M148" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> during the period [<inline-formula><mml:math id="M149" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M150" display="inline"><mml:mi>T</mml:mi></mml:math></inline-formula>] would be
            <disp-formula id="Ch1.Ex5"><mml:math id="M151" display="block"><mml:mrow><mml:mi>E</mml:mi><mml:mfenced close="]" open="["><mml:mrow><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi mathvariant="normal">∞</mml:mi></mml:munderover><mml:msub><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mfenced open="{" close="}"><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≤</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:msub><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>
          Alternatively, if the plan  is to perform a PM for the component <inline-formula><mml:math id="M152" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> at time <inline-formula><mml:math id="M153" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>, and then to perform replacements of the component <inline-formula><mml:math id="M154" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> whenever it breaks down, then the total cost would be
            <disp-formula id="Ch1.Ex6"><mml:math id="M155" display="block"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mi>E</mml:mi><mml:mfenced close="]" open="["><mml:mrow><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi mathvariant="normal">∞</mml:mi></mml:munderover><mml:msub><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mfenced open="{" close="}"><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≤</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:msub><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>
          Taking into account the difference between these two total costs,
            <disp-formula id="Ch1.E14" content-type="numbered"><label>14</label><mml:math id="M156" display="block"><mml:mtable rowspacing="0.2ex" class="split" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mfenced open="[" close="]"><mml:mrow><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi mathvariant="normal">∞</mml:mi></mml:munderover><mml:msub><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mfenced open="{" close="}"><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≤</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:msub><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>-</mml:mo><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mo>-</mml:mo><mml:mi>E</mml:mi><mml:mfenced open="[" close="]"><mml:mrow><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi mathvariant="normal">∞</mml:mi></mml:munderover><mml:msub><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≤</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:msub><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:msubsup><mml:mi>U</mml:mi><mml:mrow><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
          we conclude that the planned PM of the component <inline-formula><mml:math id="M157" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> at time <inline-formula><mml:math id="M158" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula> is justified only if <inline-formula><mml:math id="M159" display="inline"><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
</sec>
<sec id="Ch1.S3.SS4">
  <label>3.4</label><title>Complete optimization model of NextPM</title>
      <p id="d1e3772">Here we put together the complete optimization model of the NextPM step:

                <disp-formula specific-use="align"><mml:math id="M160" display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mi mathvariant="normal">minimize</mml:mi><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>f</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msup><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:mfenced><mml:mo>:=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:munderover><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mfenced open="(" close=""><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mn mathvariant="normal">1</mml:mn></mml:msubsup><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mfenced open="" close=")"><mml:mrow><mml:mo>+</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mo>+</mml:mo><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>n</mml:mi></mml:msubsup></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mi mathvariant="normal">subject</mml:mi><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi mathvariant="normal">to</mml:mi><mml:mspace width="0.25em" linebreak="nobreak"/><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:munderover><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>≥</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo mathvariant="italic">}</mml:mo><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo mathvariant="italic">}</mml:mo><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>n</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</sec>
<sec id="Ch1.S3.SS5">
  <label>3.5</label><title>NextOM model</title>
      <?pagebreak page954?><p id="d1e4287">The NextOM step of Algorithm 1 is a specialized version of the NextPM step described above. The input vector of the NextOM algorithm
            <disp-formula id="Ch1.Ex14"><mml:math id="M161" display="block"><mml:mrow><mml:mfenced close=")" open="("><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:msub><mml:mi>t</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:math></disp-formula>
          treats <inline-formula><mml:math id="M162" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> as the label of the component whose failure at some time during [<inline-formula><mml:math id="M163" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>) has triggered the OM planning step. For a pair <inline-formula><mml:math id="M164" display="inline"><mml:mrow><mml:mo mathvariant="italic">{</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>, an <inline-formula><mml:math id="M165" display="inline"><mml:mrow><mml:mo mathvariant="italic">{</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M166" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> <italic>plan</italic> is any set of vectors (<inline-formula><mml:math id="M167" display="inline"><mml:mi mathvariant="bold-italic">z</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M168" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M169" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>) whose components are two-dimensional vectors
            <disp-formula id="Ch1.E15" content-type="numbered"><label>15</label><mml:math id="M170" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mo>=</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>j</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          with binary coordinates <inline-formula><mml:math id="M171" display="inline"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M172" display="inline"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> satisfying the following linear conditions:

                <disp-formula specific-use="align" content-type="numbered"><mml:math id="M173" display="block"><mml:mtable displaystyle="true"><mml:mlabeledtr id="Ch1.E16"><mml:mtd><mml:mtext>16</mml:mtext></mml:mtd><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:munderover><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr><mml:mlabeledtr id="Ch1.E17"><mml:mtd><mml:mtext>17</mml:mtext></mml:mtd><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr><mml:mlabeledtr id="Ch1.E18"><mml:mtd><mml:mtext>18</mml:mtext></mml:mtd><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>≥</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>n</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr></mml:mtable></mml:math></disp-formula>

            Observe that, necessarily, <inline-formula><mml:math id="M174" display="inline"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
      <p id="d1e4777">The NextOM optimization model uses the following modified version of the objective function (Eq. <xref ref-type="disp-formula" rid="Ch1.E5"/>):
            <disp-formula id="Ch1.E19" content-type="numbered"><label>19</label><mml:math id="M175" display="block"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mfenced close=")" open="("><mml:mrow><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msup><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:mfenced><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:munderover><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msub><mml:mi>z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:munder><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>≠</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          where <inline-formula><mml:math id="M176" display="inline"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> is defined in Sect. <xref ref-type="sec" rid="Ch1.S3.SS2"/>. Let (<inline-formula><mml:math id="M177" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover></mml:math></inline-formula>, <inline-formula><mml:math id="M178" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover></mml:math></inline-formula>) be the solution to the linear optimization problem
            <disp-formula id="Ch1.E20" content-type="numbered"><label>20</label><mml:math id="M179" display="block"><mml:mrow><mml:mi mathvariant="normal">minimise</mml:mi><mml:mspace width="0.25em" linebreak="nobreak"/><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mfenced open="(" close=")"><mml:mrow><mml:mi mathvariant="bold-italic">z</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msup><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:mfenced></mml:mrow></mml:math></disp-formula>
          over all <inline-formula><mml:math id="M180" display="inline"><mml:mrow><mml:mo mathvariant="italic">{</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M181" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> plans subject to the linear constraints
            <disp-formula id="Ch1.E21" content-type="numbered"><label>21</label><mml:math id="M182" display="block"><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          where <inline-formula><mml:math id="M183" display="inline"><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> is defined in Sect. <xref ref-type="sec" rid="Ch1.S3.SS3"/>. The output of the NextOM  is given by the set
            <disp-formula id="Ch1.Ex15"><mml:math id="M184" display="block"><mml:mrow><mml:mi mathvariant="script">O</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mrow><mml:mi>j</mml:mi><mml:mo>:</mml:mo><mml:msubsup><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mi mathvariant="italic">τ</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>n</mml:mi></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          consisting of the labels of the components which will be opportunistically maintained along with the component <inline-formula><mml:math id="M185" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> undergoing a CM activity.</p>
</sec>
</sec>
<sec id="Ch1.S4">
  <label>4</label><title>Numerical studies</title>
      <p id="d1e5194">The three case studies analyzed in this section treat a wind turbine as a system represented by four components. They are all based on the parameter values taken from the paper <xref ref-type="bibr" rid="bib1.bibx12" id="text.15"/> (see Table <xref ref-type="table" rid="Ch1.T1"/>), where the cost unit is USD 1000 and the time unit is 1 month. The lifetime of the wind turbine is assumed to be 30 years. This implies the parameter value <inline-formula><mml:math id="M186" display="inline"><mml:mrow><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">360</mml:mn></mml:mrow></mml:math></inline-formula> months. As to other model parameters, it is assumed that<def-list>
          <def-item><term> </term><def>

      <p id="d1e5220"><inline-formula><mml:math id="M187" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>, which implies that all four components initially are as good as new;</p>
          </def></def-item>
          <def-item><term> </term><def>

      <p id="d1e5240"><inline-formula><mml:math id="M188" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">60</mml:mn></mml:mrow></mml:math></inline-formula> months – see Sect. <xref ref-type="sec" rid="Ch1.S4.SS1"/> for motivation; and</p>
          </def></def-item>
          <def-item><term> </term><def>

      <p id="d1e5262"><inline-formula><mml:math id="M189" display="inline"><mml:mrow><mml:mi mathvariant="italic">λ</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:math></inline-formula>, based on <xref ref-type="bibr" rid="bib1.bibx5" id="text.16"/>.</p>
          </def></def-item>
        </def-list></p>
      <p id="d1e5281">Comparing the characteristics of four wind turbine components shown in Table <xref ref-type="table" rid="Ch1.T1"/>, it is important to observe a strict ordering from the perspective of the associated PM costs. For example, consider components 1 and 2. The rightmost column says that the expected life length of the gearbox is smaller by 18.5 months, which on its own suggests a higher rate of replacements for the component 1. But even the other two parameters, CM cost and PM cost, are ordered in a way <inline-formula><mml:math id="M190" display="inline"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>&gt;</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M191" display="inline"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>&gt;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, which is favorable for more frequent replacements of component 1 compared to component 2.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T1" specific-use="star"><?xmltex \currentcnt{1}?><label>Table 1</label><caption><p id="d1e5325">Key parameters for a four-component system.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="7">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="center"/>
     <oasis:colspec colnum="3" colname="col3" align="center"/>
     <oasis:colspec colnum="4" colname="col4" align="center"/>
     <oasis:colspec colnum="5" colname="col5" align="center"/>
     <oasis:colspec colnum="6" colname="col6" align="right"/>
     <oasis:colspec colnum="7" colname="col7" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">Component</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M192" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3">CM cost</oasis:entry>
         <oasis:entry colname="col4">PM cost</oasis:entry>
         <oasis:entry colname="col5"><inline-formula><mml:math id="M193" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col6"><inline-formula><mml:math id="M194" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col7"><inline-formula><mml:math id="M195" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M196" display="inline"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (USD 1000)</oasis:entry>
         <oasis:entry colname="col4"><inline-formula><mml:math id="M197" display="inline"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (USD 1000)</oasis:entry>
         <oasis:entry colname="col5">(months)</oasis:entry>
         <oasis:entry colname="col6">(months)</oasis:entry>
         <oasis:entry colname="col7"/>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Gearbox</oasis:entry>
         <oasis:entry colname="col2">1</oasis:entry>
         <oasis:entry colname="col3">202</oasis:entry>
         <oasis:entry colname="col4">46.75</oasis:entry>
         <oasis:entry colname="col5">3</oasis:entry>
         <oasis:entry colname="col6">80</oasis:entry>
         <oasis:entry colname="col7">71.4</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Rotor</oasis:entry>
         <oasis:entry colname="col2">2</oasis:entry>
         <oasis:entry colname="col3">162</oasis:entry>
         <oasis:entry colname="col4">36.75</oasis:entry>
         <oasis:entry colname="col5">3</oasis:entry>
         <oasis:entry colname="col6">100</oasis:entry>
         <oasis:entry colname="col7">89.9</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Generator</oasis:entry>
         <oasis:entry colname="col2">3</oasis:entry>
         <oasis:entry colname="col3">150</oasis:entry>
         <oasis:entry colname="col4">33.75</oasis:entry>
         <oasis:entry colname="col5">2</oasis:entry>
         <oasis:entry colname="col6">110</oasis:entry>
         <oasis:entry colname="col7">97.5</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Main bearing</oasis:entry>
         <oasis:entry colname="col2">4</oasis:entry>
         <oasis:entry colname="col3">110</oasis:entry>
         <oasis:entry colname="col4">23.75</oasis:entry>
         <oasis:entry colname="col5">2</oasis:entry>
         <oasis:entry colname="col6">125</oasis:entry>
         <oasis:entry colname="col7">110.8</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d1e5554">All computational tests are performed on an Intel 2.40 GHz dual-core Windows PC with 16 GB RAM. The mathematical optimization models are implemented in AMPL IDE (version 3.5); the model components (Eqs. <xref ref-type="disp-formula" rid="Ch1.E10"/> and <xref ref-type="disp-formula" rid="Ch1.E7"/>) are calculated by MATLAB (version R2015b), and then the optimization problems are solved using CPLEX (version 12.8).</p>
<sec id="Ch1.S4.SS1">
  <label>4.1</label><title>Study 1: focusing on a single component at a time</title>
      <p id="d1e5568">If <inline-formula><mml:math id="M198" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M199" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>≡</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M200" display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>, the objective function (Eq. <xref ref-type="disp-formula" rid="Ch1.E5"/>) takes the form
            <disp-formula id="Ch1.E22" content-type="numbered"><label>22</label><mml:math id="M201" display="block"><mml:mrow><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:msub><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mi>d</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mi>t</mml:mi></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          where given a sequence of independent random variables <inline-formula><mml:math id="M202" display="inline"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mover><mml:mo movablelimits="false">=</mml:mo><mml:mi>d</mml:mi></mml:mover><mml:mi>L</mml:mi></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math id="M203" display="inline"><mml:mi>L</mml:mi></mml:math></inline-formula> having a Weibull (<inline-formula><mml:math id="M204" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M205" display="inline"><mml:mi mathvariant="italic">β</mml:mi></mml:math></inline-formula>) distribution,
            <disp-formula id="Ch1.E23" content-type="numbered"><label>23</label><mml:math id="M206" display="block"><mml:mrow><?xmltex \hack{\hbox\bgroup\fontsize{9.1}{9.1}\selectfont$\displaystyle}?><mml:msub><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>c</mml:mi><mml:mo>+</mml:mo><mml:mi>E</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi mathvariant="normal">∞</mml:mi></mml:munderover><mml:msub><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mo>+</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:msub><mml:mfenced close="]" open="["><mml:mrow><mml:mi>b</mml:mi><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mo>-</mml:mo><mml:msup><mml:mfenced close=")" open="("><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mi>t</mml:mi></mml:mfrac></mml:mstyle></mml:mfenced><mml:mi mathvariant="italic">λ</mml:mi></mml:msup><mml:mo>(</mml:mo><mml:mi>c</mml:mi><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>.</mml:mo><?xmltex \hack{$\egroup}?></mml:mrow></mml:math></disp-formula>
          In the single component setting, coefficient <inline-formula><mml:math id="M207" display="inline"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> in Eq. (<xref ref-type="disp-formula" rid="Ch1.E22"/>) describes the monthly maintenance cost if the next PM is planned at time <inline-formula><mml:math id="M208" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula> (assuming that at time 0 the component was as good as new). In this section, we analyze the behavior of the function <inline-formula><mml:math id="M209" display="inline"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> under some realistic model parameters. It turns out, in the current setting, that minimizing the objective function (Eq. <xref ref-type="disp-formula" rid="Ch1.E5"/>) is equivalent to minimizing <inline-formula><mml:math id="M210" display="inline"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> over <inline-formula><mml:math id="M211" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, …, <inline-formula><mml:math id="M212" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, and, moreover, the constraint (Eq. <xref ref-type="disp-formula" rid="Ch1.E7"/>) can effectively be disregarded. As a result of this analysis, we propose <inline-formula><mml:math id="M213" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">60</mml:mn></mml:mrow></mml:math></inline-formula> months as a practical length of the planning period for our algorithm.</p>
      <p id="d1e5907">Figure <xref ref-type="fig" rid="Ch1.F4"/> presents a typical profile for the monthly maintenance cost <inline-formula><mml:math id="M214" display="inline"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> as a function of the time <inline-formula><mml:math id="M215" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula> of the next PM planned activity. The inset of Fig. <xref ref-type="fig" rid="Ch1.F4"/> clearly shows that the best time for next PM is at <inline-formula><mml:math id="M216" display="inline"><mml:mrow><mml:mi mathvariant="italic">τ</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">43</mml:mn></mml:mrow></mml:math></inline-formula> given the mobilization cost of <inline-formula><mml:math id="M217" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula>. The maintenance cost in this case is <inline-formula><mml:math id="M218" display="inline"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mn mathvariant="normal">43</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">1700</mml:mn></mml:mrow></mml:math></inline-formula> per month.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F4"><?xmltex \currentcnt{4}?><?xmltex \def\figurename{Figure}?><label>Figure 4</label><caption><p id="d1e5980">Monthly maintenance cost for the gearbox with the mobilization cost <inline-formula><mml:math id="M219" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula>.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://wes.copernicus.org/articles/6/949/2021/wes-6-949-2021-f04.png"/>

        </fig>

      <?pagebreak page955?><p id="d1e6002">The same value <inline-formula><mml:math id="M220" display="inline"><mml:mrow><mml:mi mathvariant="italic">τ</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">43</mml:mn></mml:mrow></mml:math></inline-formula> can be also seen on the lowest among four lines depicted on Fig. <xref ref-type="fig" rid="Ch1.F5"/> if parameter <inline-formula><mml:math id="M221" display="inline"><mml:mi>d</mml:mi></mml:math></inline-formula>, shown on the horizontal axis, takes a value of 5. The gearbox line on Fig. <xref ref-type="fig" rid="Ch1.F5"/> displays larger values of <inline-formula><mml:math id="M222" display="inline"><mml:mi mathvariant="italic">τ</mml:mi></mml:math></inline-formula> for higher mobilization costs <inline-formula><mml:math id="M223" display="inline"><mml:mi>d</mml:mi></mml:math></inline-formula>. The same pattern is seen for the other three components taken one at a time.</p>
      <p id="d1e6043">Now we are ready to explain how the results of our analysis justify the proposed value <inline-formula><mml:math id="M224" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">60</mml:mn></mml:mrow></mml:math></inline-formula> months for the length of the next PM planning period. The ideal choice of <inline-formula><mml:math id="M225" display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula> must satisfy two contradicting requirements. On the one hand, <inline-formula><mml:math id="M226" display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula> should not be very small to avoid too many NextPM steps in Algorithm 1 advising for no PM activities during the next planning period. On the other hand, a smaller value of the parameter <inline-formula><mml:math id="M227" display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula> would significantly reduce the computational time of the NextPM model. As a compromise solution, we choose <inline-formula><mml:math id="M228" display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula> in such way that at least one PM activity is expected to be scheduled during the planning horizon. Since gearbox is expected to be replaced most often, referring to Figs. <xref ref-type="fig" rid="Ch1.F4"/> and <xref ref-type="fig" rid="Ch1.F5"/>, we take the value of <inline-formula><mml:math id="M229" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">60</mml:mn></mml:mrow></mml:math></inline-formula> months for our case studies.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F5"><?xmltex \currentcnt{5}?><?xmltex \def\figurename{Figure}?><label>Figure 5</label><caption><p id="d1e6105">The optimal next PM time <inline-formula><mml:math id="M230" display="inline"><mml:mi mathvariant="italic">τ</mml:mi></mml:math></inline-formula> as a function of the mobilization cost <inline-formula><mml:math id="M231" display="inline"><mml:mi>d</mml:mi></mml:math></inline-formula> for different single-component systems.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://wes.copernicus.org/articles/6/949/2021/wes-6-949-2021-f05.png"/>

        </fig>

</sec>
<sec id="Ch1.S4.SS2">
  <label>4.2</label><title>Study 2: seasonal effects</title>
      <p id="d1e6136">In this section, we study how different mobilization costs <inline-formula><mml:math id="M232" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> result in different optimal PM schedules. Part A presents a baseline study of a pure CM strategy with no PM activities. Part B deals with seasonally changing <inline-formula><mml:math id="M233" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> around the average value <inline-formula><mml:math id="M234" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">10</mml:mn><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">000</mml:mn></mml:mrow></mml:math></inline-formula>. Part C takes up a similar case with a lower average mobilization cost <inline-formula><mml:math id="M235" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
<sec id="Ch1.S4.SS2.SSS1">
  <label>4.2.1</label><title>Part A</title>
      <p id="d1e6207">Consider the simplest wind turbine maintenance strategy when the PM option is ignored and a CM activity is performed whenever a turbine component breaks down. This baseline case study will help us to evaluate how much can be saved by introducing PM planning.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T2" specific-use="star"><?xmltex \currentcnt{2}?><label>Table 2</label><caption><p id="d1e6213">Summary of the NextPM results for <inline-formula><mml:math id="M236" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USS</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mn mathvariant="normal">10</mml:mn><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mn mathvariant="normal">000</mml:mn></mml:mrow></mml:math></inline-formula>.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="7">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="center"/>
     <oasis:colspec colnum="3" colname="col3" align="center"/>
     <oasis:colspec colnum="4" colname="col4" align="center"/>
     <oasis:colspec colnum="5" colname="col5" align="center"/>
     <oasis:colspec colnum="6" colname="col6" align="left"/>
     <oasis:colspec colnum="7" colname="col7" align="center"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">Component <inline-formula><mml:math id="M237" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">1</oasis:entry>
         <oasis:entry colname="col3">2</oasis:entry>
         <oasis:entry colname="col4">3</oasis:entry>
         <oasis:entry colname="col5">4</oasis:entry>
         <oasis:entry colname="col6">Corresponding</oasis:entry>
         <oasis:entry colname="col7">Monthly</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">month</oasis:entry>
         <oasis:entry colname="col7">maintenance</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6"/>
         <oasis:entry colname="col7">cost</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Winter start</oasis:entry>
         <oasis:entry colname="col2">54</oasis:entry>
         <oasis:entry colname="col3">54</oasis:entry>
         <oasis:entry colname="col4">54</oasis:entry>
         <oasis:entry colname="col5">54</oasis:entry>
         <oasis:entry colname="col6">Jun</oasis:entry>
         <oasis:entry colname="col7">USD 5010</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Summer start</oasis:entry>
         <oasis:entry colname="col2">49</oasis:entry>
         <oasis:entry colname="col3">49</oasis:entry>
         <oasis:entry colname="col4">49</oasis:entry>
         <oasis:entry colname="col5">49</oasis:entry>
         <oasis:entry colname="col6">Jul</oasis:entry>
         <oasis:entry colname="col7">USD 4979</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Constant mobilization cost</oasis:entry>
         <oasis:entry colname="col2">52</oasis:entry>
         <oasis:entry colname="col3">52</oasis:entry>
         <oasis:entry colname="col4">52</oasis:entry>
         <oasis:entry colname="col5">52</oasis:entry>
         <oasis:entry colname="col6">–</oasis:entry>
         <oasis:entry colname="col7">USD 5061</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <?pagebreak page956?><p id="d1e6408">The total cost associated with the pure CM strategy is estimated based on the random number of failures over the time interval [0, <inline-formula><mml:math id="M238" display="inline"><mml:mi>T</mml:mi></mml:math></inline-formula>] for all <inline-formula><mml:math id="M239" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> components
              <disp-formula id="Ch1.E24" content-type="numbered"><label>24</label><mml:math id="M240" display="block"><mml:mtable class="split" rowspacing="0.2ex" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mrow><mml:mi>F</mml:mi><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mi>E</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi mathvariant="normal">∞</mml:mi></mml:munderover><mml:msub><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:msubsup><mml:mi>V</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≤</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:msub><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:msubsup><mml:mi>V</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:munderover><mml:mo movablelimits="false">∫</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mi>T</mml:mi></mml:munderover><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>u</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mi>d</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
            where <inline-formula><mml:math id="M241" display="inline"><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are the corresponding renewal functions
              <disp-formula id="Ch1.E25" content-type="numbered"><label>25</label><mml:math id="M242" display="block"><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi mathvariant="normal">∞</mml:mi></mml:munderover><mml:msub><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mfenced close="}" open="{"><mml:mrow><mml:msubsup><mml:mi>V</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>≤</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>t</mml:mi><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi>n</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>
            According to the standard renewal theory (see for example  <xref ref-type="bibr" rid="bib1.bibx3" id="altparen.17"/>), for large values of <inline-formula><mml:math id="M243" display="inline"><mml:mi>T</mml:mi></mml:math></inline-formula>,
              <disp-formula id="Ch1.E26" content-type="numbered"><label>26</label><mml:math id="M244" display="block"><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mi>F</mml:mi><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:mfrac></mml:mstyle><mml:mo>≈</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mi>T</mml:mi><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∫</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mi>T</mml:mi></mml:munderover><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>u</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mi>d</mml:mi><mml:mi>u</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
            where
              <disp-formula id="Ch1.Ex16"><mml:math id="M245" display="block"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow><mml:mi>T</mml:mi></mml:mfrac></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>
            Applying this approximation to the four-component model of the wind turbine, the monthly maintenance costs for the pure CM strategy are computed to be USD 7396 for <inline-formula><mml:math id="M246" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula> and USD 7618 for <inline-formula><mml:math id="M247" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">10</mml:mn><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">000</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
</sec>
<sec id="Ch1.S4.SS2.SSS2">
  <label>4.2.2</label><title>Part B</title>
      <p id="d1e6868">To address the seasonal effects of the mobilization costs <inline-formula><mml:math id="M248" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, the following mobilization costs (in thousands of USD) for different months in a year are used.
<?xmltex \hack{\\}?><?xmltex \hack{\\}?>
<table-wrap id="Taba" position="anchor"><oasis:table><?xmltex \begin{scaleboxenv}{.72}[.72]?><oasis:tgroup cols="12">
     <oasis:colspec colnum="1" colname="col1" align="center"/>
     <oasis:colspec colnum="2" colname="col2" align="center"/>
     <oasis:colspec colnum="3" colname="col3" align="center"/>
     <oasis:colspec colnum="4" colname="col4" align="center"/>
     <oasis:colspec colnum="5" colname="col5" align="center"/>
     <oasis:colspec colnum="6" colname="col6" align="center"/>
     <oasis:colspec colnum="7" colname="col7" align="center"/>
     <oasis:colspec colnum="8" colname="col8" align="center"/>
     <oasis:colspec colnum="9" colname="col9" align="center"/>
     <oasis:colspec colnum="10" colname="col10" align="center"/>
     <oasis:colspec colnum="11" colname="col11" align="center"/>
     <oasis:colspec colnum="12" colname="col12" align="center"/>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Jan</oasis:entry>
         <oasis:entry colname="col2">Feb</oasis:entry>
         <oasis:entry colname="col3">Mar</oasis:entry>
         <oasis:entry colname="col4">Apr</oasis:entry>
         <oasis:entry colname="col5">May</oasis:entry>
         <oasis:entry colname="col6">Jun</oasis:entry>
         <oasis:entry colname="col7">Jul</oasis:entry>
         <oasis:entry colname="col8">Aug</oasis:entry>
         <oasis:entry colname="col9">Sep</oasis:entry>
         <oasis:entry colname="col10">Oct</oasis:entry>
         <oasis:entry colname="col11">Nov</oasis:entry>
         <oasis:entry colname="col12">Dec</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">15</oasis:entry>
         <oasis:entry colname="col2">13</oasis:entry>
         <oasis:entry colname="col3">11</oasis:entry>
         <oasis:entry colname="col4">9</oasis:entry>
         <oasis:entry colname="col5">7</oasis:entry>
         <oasis:entry colname="col6">5</oasis:entry>
         <oasis:entry colname="col7">5</oasis:entry>
         <oasis:entry colname="col8">7</oasis:entry>
         <oasis:entry colname="col9">9</oasis:entry>
         <oasis:entry colname="col10">11</oasis:entry>
         <oasis:entry colname="col11">13</oasis:entry>
         <oasis:entry colname="col12">15</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup><?xmltex \end{scaleboxenv}?></oasis:table></table-wrap>
         <?xmltex \hack{\\}?><?xmltex \hack{\\}?><?xmltex \hack{\noindent}?>It is assumed that the mobilization costs for different months are different, but for the same month in different years they are the same. In this case, the average mobilization cost is <inline-formula><mml:math id="M249" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">10</mml:mn><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mn mathvariant="normal">000</mml:mn></mml:mrow></mml:math></inline-formula>. The given monthly costs are based on a discussion with the experts affiliated with the Swedish Wind Power Technology Centre (SWPTC). Table <xref ref-type="table" rid="Ch1.T2"/> summarizes the results produced by the NextPM algorithm applied to the following three settings:<def-list>
              <def-item><term>Winter start scenario.</term><def>

      <p id="d1e7036">If the wind turbine starts functioning in January, then the mobilization costs <inline-formula><mml:math id="M250" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (in thousands of USD) follow the following periodical dynamics over time <inline-formula><mml:math id="M251" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, 2, …:
                    <disp-formula id="Ch1.Ex17"><mml:math id="M252" display="block"><mml:mrow><?xmltex \hack{\hbox\bgroup\fontsize{9.5}{9.5}\selectfont$\displaystyle}?><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">15</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">13</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">12</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">15</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">13</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">15</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">14</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">13</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">…</mml:mi><?xmltex \hack{$\egroup}?></mml:mrow></mml:math></disp-formula></p>
              </def></def-item>
              <def-item><term>Summer start scenario.</term><def>

      <p id="d1e7144">If the wind turbine starts functioning in July, then the mobilization costs <inline-formula><mml:math id="M253" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are taking the values (in thousands of USD):
                    <disp-formula id="Ch1.Ex18"><mml:math id="M254" display="block"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">5</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">7</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">12</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">5</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">13</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">5</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">14</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">7</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="normal">…</mml:mi></mml:mrow></mml:math></disp-formula></p>
              </def></def-item>
              <def-item><term>Constant mobilization cost scenario.</term><def>

      <p id="d1e7238">This scenario has no seasonal effect in that for each month <inline-formula><mml:math id="M255" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>, the mobilization cost <inline-formula><mml:math id="M256" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the same:
<inline-formula><mml:math id="M257" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M258" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M259" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula>, … (in thousands of USD).</p>
              </def></def-item>
            </def-list>Our results suggest (as a consequence of high mobilization costs) performing PM to all four components at a certain time, irrespective of the scenario. With the summer start setting, the average monthly maintenance cost is somewhat lower. Notice that in all of the seasonal settings, the proposed PM activities are scheduled for summer months (having lower mobilization costs). Observe that all three monthly averages (USD 5010, 4979, 5061) are much lower than the baseline value USD 7618 obtained in Part A.</p>
</sec>
<sec id="Ch1.S4.SS2.SSS3">
  <label>4.2.3</label><title>Part C</title>
      <p id="d1e7315">In this section, the mobilization costs are halved to contrast the results of Part B, so that <inline-formula><mml:math id="M260" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M261" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> take the following values (in thousands of USD) depending on which month of the year lies behind the time parameter <inline-formula><mml:math id="M262" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>. <?xmltex \hack{\\}?><?xmltex \hack{\\}?>
<table-wrap id="Tabb" position="anchor"><oasis:table><?xmltex \begin{scaleboxenv}{.72}[.72]?><oasis:tgroup cols="12">
     <oasis:colspec colnum="1" colname="col1" align="center"/>
     <oasis:colspec colnum="2" colname="col2" align="center"/>
     <oasis:colspec colnum="3" colname="col3" align="center"/>
     <oasis:colspec colnum="4" colname="col4" align="center"/>
     <oasis:colspec colnum="5" colname="col5" align="center"/>
     <oasis:colspec colnum="6" colname="col6" align="center"/>
     <oasis:colspec colnum="7" colname="col7" align="center"/>
     <oasis:colspec colnum="8" colname="col8" align="center"/>
     <oasis:colspec colnum="9" colname="col9" align="center"/>
     <oasis:colspec colnum="10" colname="col10" align="center"/>
     <oasis:colspec colnum="11" colname="col11" align="center"/>
     <oasis:colspec colnum="12" colname="col12" align="center"/>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Jan</oasis:entry>
         <oasis:entry colname="col2">Feb</oasis:entry>
         <oasis:entry colname="col3">Mar</oasis:entry>
         <oasis:entry colname="col4">Apr</oasis:entry>
         <oasis:entry colname="col5">May</oasis:entry>
         <oasis:entry colname="col6">Jun</oasis:entry>
         <oasis:entry colname="col7">Jul</oasis:entry>
         <oasis:entry colname="col8">Aug</oasis:entry>
         <oasis:entry colname="col9">Sep</oasis:entry>
         <oasis:entry colname="col10">Oct</oasis:entry>
         <oasis:entry colname="col11">Nov</oasis:entry>
         <oasis:entry colname="col12">Dec</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">7.5</oasis:entry>
         <oasis:entry colname="col2">6.5</oasis:entry>
         <oasis:entry colname="col3">5.5</oasis:entry>
         <oasis:entry colname="col4">4.5</oasis:entry>
         <oasis:entry colname="col5">3.5</oasis:entry>
         <oasis:entry colname="col6">2.5</oasis:entry>
         <oasis:entry colname="col7">2.5</oasis:entry>
         <oasis:entry colname="col8">3.5</oasis:entry>
         <oasis:entry colname="col9">4.5</oasis:entry>
         <oasis:entry colname="col10">5.5</oasis:entry>
         <oasis:entry colname="col11">6.5</oasis:entry>
         <oasis:entry colname="col12">7.5</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup><?xmltex \end{scaleboxenv}?></oasis:table></table-wrap>
         <?xmltex \hack{\\}?><?xmltex \hack{\\}?><?xmltex \hack{\noindent}?>The new results presented in Table <xref ref-type="table" rid="Ch1.T3"/> are drastically different from the results of Part B.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T3" specific-use="star"><?xmltex \currentcnt{3}?><label>Table 3</label><caption><p id="d1e7484">Summary of the NextPM results for <inline-formula><mml:math id="M263" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula>.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="8">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="center"/>
     <oasis:colspec colnum="3" colname="col3" align="center"/>
     <oasis:colspec colnum="4" colname="col4" align="center"/>
     <oasis:colspec colnum="5" colname="col5" align="center"/>
     <oasis:colspec colnum="6" colname="col6" align="center"/>
     <oasis:colspec colnum="7" colname="col7" align="center"/>
     <oasis:colspec colnum="8" colname="col8" align="left"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">Component <inline-formula><mml:math id="M264" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">1</oasis:entry>
         <oasis:entry colname="col3">2</oasis:entry>
         <oasis:entry colname="col4">3</oasis:entry>
         <oasis:entry colname="col5">4</oasis:entry>
         <oasis:entry colname="col6">Corresponding</oasis:entry>
         <oasis:entry colname="col7">Monthly</oasis:entry>
         <oasis:entry colname="col8"/>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">month</oasis:entry>
         <oasis:entry colname="col7">maintenance</oasis:entry>
         <oasis:entry colname="col8"/>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6"/>
         <oasis:entry colname="col7">cost</oasis:entry>
         <oasis:entry colname="col8"/>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Winter start</oasis:entry>
         <oasis:entry colname="col2">43</oasis:entry>
         <oasis:entry colname="col3">x</oasis:entry>
         <oasis:entry colname="col4">x</oasis:entry>
         <oasis:entry colname="col5">x</oasis:entry>
         <oasis:entry colname="col6">Jul</oasis:entry>
         <oasis:entry colname="col7">USD 4876</oasis:entry>
         <oasis:entry colname="col8"/>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Summer start</oasis:entry>
         <oasis:entry colname="col2">48</oasis:entry>
         <oasis:entry colname="col3">48</oasis:entry>
         <oasis:entry colname="col4">x</oasis:entry>
         <oasis:entry colname="col5">x</oasis:entry>
         <oasis:entry colname="col6">Jun</oasis:entry>
         <oasis:entry colname="col7">USD 4863</oasis:entry>
         <oasis:entry colname="col8"/>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Constant mobilization cost</oasis:entry>
         <oasis:entry colname="col2">50</oasis:entry>
         <oasis:entry colname="col3">50</oasis:entry>
         <oasis:entry colname="col4">50</oasis:entry>
         <oasis:entry colname="col5">50</oasis:entry>
         <oasis:entry colname="col6">–</oasis:entry>
         <oasis:entry colname="col7">USD 4964</oasis:entry>
         <oasis:entry colname="col8"/>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d1e7690">According to Table <xref ref-type="table" rid="Ch1.T3"/>, in the winter start setting, the optimal next PM plan suggests a PM activity on month 43 only for component 1, the gearbox. With the seasonal mobilization cost, the next PM is always planned during the summer since the mobilization cost is low then. Again, the most economic among the three scenarios is to start in the summertime, with the optimal plan being to perform the next PM activity on month 48 by replacing the components 1 and 2.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T4" specific-use="star"><?xmltex \currentcnt{4}?><label>Table 4</label><caption><p id="d1e7699">Outputs of the NextPM and PMSPIC models for <inline-formula><mml:math id="M265" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">1000</mml:mn></mml:mrow></mml:math></inline-formula>.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="8">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="center"/>
     <oasis:colspec colnum="3" colname="col3" align="center"/>
     <oasis:colspec colnum="4" colname="col4" align="center"/>
     <oasis:colspec colnum="5" colname="col5" align="center"/>
     <oasis:colspec colnum="6" colname="col6" align="center"/>
     <oasis:colspec colnum="7" colname="col7" align="right"/>
     <oasis:colspec colnum="8" colname="col8" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M266" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">1000</mml:mn></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">1</oasis:entry>
         <oasis:entry colname="col3">2</oasis:entry>
         <oasis:entry colname="col4">3</oasis:entry>
         <oasis:entry colname="col5">4</oasis:entry>
         <oasis:entry colname="col6">Monthly</oasis:entry>
         <oasis:entry colname="col7">MATLAB</oasis:entry>
         <oasis:entry colname="col8">AMPL</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">maintenance</oasis:entry>
         <oasis:entry colname="col7"/>
         <oasis:entry colname="col8"/>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">cost</oasis:entry>
         <oasis:entry colname="col7"/>
         <oasis:entry colname="col8"/>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">NextPM</oasis:entry>
         <oasis:entry colname="col2">43</oasis:entry>
         <oasis:entry colname="col3">x</oasis:entry>
         <oasis:entry colname="col4">x</oasis:entry>
         <oasis:entry colname="col5">x</oasis:entry>
         <oasis:entry colname="col6">USD 4731</oasis:entry>
         <oasis:entry colname="col7">49 s</oasis:entry>
         <oasis:entry colname="col8">0.01 s</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">PMSPIC</oasis:entry>
         <oasis:entry colname="col2">49</oasis:entry>
         <oasis:entry colname="col3">x</oasis:entry>
         <oasis:entry colname="col4">x</oasis:entry>
         <oasis:entry colname="col5">x</oasis:entry>
         <oasis:entry colname="col6">USD 4746</oasis:entry>
         <oasis:entry colname="col7">135 s</oasis:entry>
         <oasis:entry colname="col8">19.64 s</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

<?xmltex \floatpos{h!}?><table-wrap id="Ch1.T5" specific-use="star"><?xmltex \currentcnt{5}?><label>Table 5</label><caption><p id="d1e7887">Outputs of the NextPM and PMSPIC models for <inline-formula><mml:math id="M267" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula>.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="8">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="center"/>
     <oasis:colspec colnum="3" colname="col3" align="center"/>
     <oasis:colspec colnum="4" colname="col4" align="center"/>
     <oasis:colspec colnum="5" colname="col5" align="center"/>
     <oasis:colspec colnum="6" colname="col6" align="center"/>
     <oasis:colspec colnum="7" colname="col7" align="right"/>
     <oasis:colspec colnum="8" colname="col8" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M268" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">1</oasis:entry>
         <oasis:entry colname="col3">2</oasis:entry>
         <oasis:entry colname="col4">3</oasis:entry>
         <oasis:entry colname="col5">4</oasis:entry>
         <oasis:entry colname="col6">Monthly</oasis:entry>
         <oasis:entry colname="col7">MATLAB</oasis:entry>
         <oasis:entry colname="col8">AMPL</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">maintenance</oasis:entry>
         <oasis:entry colname="col7"/>
         <oasis:entry colname="col8"/>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">cost</oasis:entry>
         <oasis:entry colname="col7"/>
         <oasis:entry colname="col8"/>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">NextPM</oasis:entry>
         <oasis:entry colname="col2">50</oasis:entry>
         <oasis:entry colname="col3">50</oasis:entry>
         <oasis:entry colname="col4">50</oasis:entry>
         <oasis:entry colname="col5">50</oasis:entry>
         <oasis:entry colname="col6">USD 4964</oasis:entry>
         <oasis:entry colname="col7">54 s</oasis:entry>
         <oasis:entry colname="col8">0.01 s</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">PMSPIC</oasis:entry>
         <oasis:entry colname="col2">51</oasis:entry>
         <oasis:entry colname="col3">51</oasis:entry>
         <oasis:entry colname="col4">51</oasis:entry>
         <oasis:entry colname="col5">51</oasis:entry>
         <oasis:entry colname="col6">USD 4881</oasis:entry>
         <oasis:entry colname="col7">132 s</oasis:entry>
         <oasis:entry colname="col8">51.56 s</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

<?xmltex \floatpos{h!}?><table-wrap id="Ch1.T6" specific-use="star"><?xmltex \currentcnt{6}?><label>Table 6</label><caption><p id="d1e8075">Outputs of the NextPM and PMSPIC models for <inline-formula><mml:math id="M269" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="italic">$</mml:mi><mml:mn mathvariant="normal">10000</mml:mn></mml:mrow></mml:math></inline-formula>.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="8">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="center"/>
     <oasis:colspec colnum="3" colname="col3" align="center"/>
     <oasis:colspec colnum="4" colname="col4" align="center"/>
     <oasis:colspec colnum="5" colname="col5" align="center"/>
     <oasis:colspec colnum="6" colname="col6" align="center"/>
     <oasis:colspec colnum="7" colname="col7" align="right"/>
     <oasis:colspec colnum="8" colname="col8" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M270" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">10</mml:mn><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">000</mml:mn></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">1</oasis:entry>
         <oasis:entry colname="col3">2</oasis:entry>
         <oasis:entry colname="col4">3</oasis:entry>
         <oasis:entry colname="col5">4</oasis:entry>
         <oasis:entry colname="col6">Monthly</oasis:entry>
         <oasis:entry colname="col7">MATLAB</oasis:entry>
         <oasis:entry colname="col8">AMPL</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">maintenance</oasis:entry>
         <oasis:entry colname="col7"/>
         <oasis:entry colname="col8"/>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">cost</oasis:entry>
         <oasis:entry colname="col7"/>
         <oasis:entry colname="col8"/>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">NextPM</oasis:entry>
         <oasis:entry colname="col2">52</oasis:entry>
         <oasis:entry colname="col3">52</oasis:entry>
         <oasis:entry colname="col4">52</oasis:entry>
         <oasis:entry colname="col5">52</oasis:entry>
         <oasis:entry colname="col6">USD 5061</oasis:entry>
         <oasis:entry colname="col7">55 s</oasis:entry>
         <oasis:entry colname="col8">0.01 s</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">PMSPIC</oasis:entry>
         <oasis:entry colname="col2">50</oasis:entry>
         <oasis:entry colname="col3">50</oasis:entry>
         <oasis:entry colname="col4">50</oasis:entry>
         <oasis:entry colname="col5">50</oasis:entry>
         <oasis:entry colname="col6">USD 5037</oasis:entry>
         <oasis:entry colname="col7">134 s</oasis:entry>
         <oasis:entry colname="col8">87.57 s</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d1e8262">The optimal times for the next PM activity have landed in the range between 43 and 50 months and seem to be quite short. This is explained by the particular choice of the model parameters presented in Table <xref ref-type="table" rid="Ch1.T1"/>: under the assumption of independence between the lives of the four components, the average time until the first failure is slightly below 50 months. (Notice that in this case study, the estimated parameters for the components' life lengths are based on the data collected<?pagebreak page957?> for wind turbines from year 1994 to 2004. For the modern wind turbines, the mean survival times will be longer.) Another important contributing factor is the assumption of low PM costs, with higher PM costs the optimal next PM activity would be scheduled at a later time. In the special case with equal PM and CM costs, the optimal solution is to forget about PM planning and fully rely the pure CM strategy.</p>
      <p id="d1e8267">Comparison of the results of Part B and Part C with those of Part A shows that implementation of the PM planning reduces maintenance costs by 35 %.</p>
</sec>
</sec>
<sec id="Ch1.S4.SS3">
  <label>4.3</label><title>A performance comparison with PMSPIC</title>
      <p id="d1e8279">In this case study, we compare the outputs of the NextPM model and the optimization model PMSPIC. A comparison of the NextPM model with the PMSPIC model is not a straightforward exercise, since the latter produces a maintenance plan for the whole lifespan [0, <inline-formula><mml:math id="M271" display="inline"><mml:mi>T</mml:mi></mml:math></inline-formula>] of the multi-component system in question. To make a fair comparison, we characterize both approaches in terms of  the time average  maintenance costs. The following three tables summarize the results for three values of the constant mobilization cost <inline-formula><mml:math id="M272" display="inline"><mml:mi>d</mml:mi></mml:math></inline-formula>:</p>
      <p id="d1e8296">Tables <xref ref-type="table" rid="Ch1.T4"/>–<xref ref-type="table" rid="Ch1.T6"/> reveal that the next PM schedules produced by NextPM and PMSPIC are quite similar. The observed small differences in the maintenance costs do not imply that PMSPIC gives better solutions, since NextPM calculates the maintenance costs within a different modeling framework. The main advantage of NextPM compared to PMSPIC is in the computational speed. The effectiveness of the algorithms is reported in the two rightmost columns. The “MATLAB” column gives the time it takes to generate the main parameters of the model. For the NextPM the number of parameters is much smaller, and they are <inline-formula><mml:math id="M273" display="inline"><mml:mrow><mml:msubsup><mml:mi>c</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M274" display="inline"><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>. The “AMPL” column gives the time it takes to solve the optimization model.  For example, if <inline-formula><mml:math id="M275" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">10</mml:mn><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mn mathvariant="normal">000</mml:mn></mml:mrow></mml:math></inline-formula>, the NextPM optimization runs 10 000 times faster than the PMSPIC optimization.</p>
      <?pagebreak page958?><p id="d1e8357">For <inline-formula><mml:math id="M276" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">USD</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mn mathvariant="normal">5000</mml:mn></mml:mrow></mml:math></inline-formula>, the NextPM calculations are performed with the time unit being 3 d. The results are rather similar to those obtained for  the time unit 1 month. Solving this problem with AMPL has required a time increase from 0.01 to 0.08 s caused by a 10-fold increase of the number of the time steps. The corresponding increase in the AMPL time for the PMSPIC model was much more dramatic: it takes more than 11 h to solve the full optimization problem.</p>
</sec>
</sec>
<sec id="Ch1.S5" sec-type="conclusions">
  <label>5</label><title>Conclusions</title>
      <p id="d1e8385">This article introduces a new NextPM optimization model aiming at PM scheduling for a wind turbine viewed as a multi-component system. Which of the components should undergo PM replacements first is decided based on the information on the component ages. Compared to the PMSPIC model from <xref ref-type="bibr" rid="bib1.bibx5" id="text.18"/> that generates a maintenance plan for the
whole lifetime of the wind turbine, the NextPM model produces an optimal schedule only for the next PM activity. By focusing on a shorter planning horizon and implementing a different model structure, we succeeded in substantially reducing the computational time.</p>
      <p id="d1e8391">NextPM is tested with three case studies based on the data for four components of the wind turbine taken from <xref ref-type="bibr" rid="bib1.bibx12" id="text.19"/>. Under the seasonal variation, our results show that PM activities should be always scheduled in the summertime. This is due to the lower mobilization costs during the summer months. When the NextPM model is compared to the pure CM strategy, it is found that around 35 % of the maintenance costs can be saved by applying the NextPM model. The third case study compares the performances of NextPM and PMSPIC algorithms, demonstrating the accuracy of the NextPM model despite being much less complex than PMSPIC.</p>
      <p id="d1e8397">In this paper our NextPM model is applied to a system of four components belonging to a single wind turbine. However, we claim that our approach can handle the case of, say, 10 turbines with 80 components in total (the computational time required by our algorithm grows linearly with the increased number of components, while PMSPIC's computational time grows exponentially fast).</p>
      <p id="d1e8400">The notable limitation of our setting is that it neglects such important maintenance activities as inspections and minor and major repairs. By considering  full replacements as the only kind of CM and PM activities allowed in the model, we were able to tame the mathematical challenge of the problem in hand. Still, even within this simplified model framework, our computational analysis may bring useful insights of more efficient PM planning, depending on a few key parameters of a concrete wind farm. Our results should be viewed as a first promising step towards a much more sophisticated mathematical optimization model that would take into account available condition monitoring data and even recognize the difference in the failure rates for minor repairs, major repairs, and component replacements.</p><?xmltex \hack{\newpage}?>
</sec>

      
      </body>
    <back><notes notes-type="codedataavailability"><title>Code and data availability</title>

      <p id="d1e8408">The code used to calculate the parameters is in MATLAB; the code is available on <uri>https://github.com/QuanjiangYu/NextPM-model/tree/main/matlab</uri> (last access: 18 June 2021) <xref ref-type="bibr" rid="bib1.bibx15" id="paren.20"/>. To solve the model, AMPL is used; the code is available on <uri>https://github.com/QuanjiangYu/NextPM-model/tree/main/ampl</uri> (last access: 18 June 2021) <xref ref-type="bibr" rid="bib1.bibx16" id="paren.21"/>. The data used to solve the model are available on
<uri>https://github.com/QuanjiangYu/NextPM-model/tree/main/data</uri> (last access: 18 June 2021) <xref ref-type="bibr" rid="bib1.bibx17" id="paren.22"/>.</p>
  </notes><notes notes-type="authorcontribution"><title>Author contributions</title>

      <p id="d1e8433">QY developed the theoretical formalism, performed the analytic calculations, and performed the numerical simulations. SS, QY, and MP contributed to the final version of the manuscript.</p>
  </notes><notes notes-type="competinginterests"><title>Competing interests</title>

      <p id="d1e8439">The authors declare that they have no conflict of interest.</p>
  </notes><ack><title>Acknowledgements</title><p id="d1e8445">We acknowledge the financial support from the Swedish Wind Power Technology Centre at Chalmers, from the Gothenburg University Library, and from the Swedish Research Council (grant no. 2014-5138). Special thanks to the director of SWPTC, Ola Carlson, for his constructive recommendations. The valuable comments of four reviewers helped considerably in improving the quality of our manuscript.</p></ack><notes notes-type="financialsupport"><title>Financial support</title>

      <p id="d1e8450">The article processing charges for this <?xmltex \notforhtml{\newline}?> open-access publication were covered by the Gothenburg <?xmltex \notforhtml{\newline}?> University Library.</p>
  </notes><notes notes-type="reviewstatement"><title>Review statement</title>

      <p id="d1e8460">This paper was edited by Katherine Dykes and reviewed by Jonas Kaczenski and Miriam Noonan.</p>
  </notes><ref-list>
    <title>References</title>

      <ref id="bib1.bibx1"><?xmltex \def\ref@label{{Andreasson et~al.(2020)Andreasson, Patriksson, and
Evgrafov}}?><label>Andreasson et al.(2020)Andreasson, Patriksson, and
Evgrafov</label><?label andreasson2020introduction?><mixed-citation>
Andreasson, N., Patriksson, M., and Evgrafov, A.: An introduction to continuous optimization: foundations and fundamental algorithms, Courier Dover Publications, Dover, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx2"><?xmltex \def\ref@label{{Browell et~al.(2016)Browell, Dinwoodie, and
McMillan}}?><label>Browell et al.(2016)Browell, Dinwoodie, and
McMillan</label><?label browell2016forecasting?><mixed-citation>
Browell, J., Dinwoodie, I., and McMillan, D.: Forecasting for day-ahead
offshore maintenance scheduling under uncertainty, in: Proceedings of the
European Safety and Reliability (ESREL) Conference, September 2016, University of Strathclyde, Strathclyde, 2016.</mixed-citation></ref>
      <ref id="bib1.bibx3"><?xmltex \def\ref@label{{Grimmett and Stirzaker(2020)}}?><label>Grimmett and Stirzaker(2020)</label><?label grimmett2020probability?><mixed-citation>
Grimmett, G. and Stirzaker, D.: Probability and random processes, Oxford University Press, Oxford, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx4"><?xmltex \def\ref@label{{Guo et~al.(2009)Guo, Watson, Tavner, and Xiang}}?><label>Guo et al.(2009)Guo, Watson, Tavner, and Xiang</label><?label guo2009reliability?><mixed-citation>
Guo, H., Watson, S., Tavner, P., and Xiang, J.: Reliability analysis for wind
turbines with incomplete failure data collected from after the date of initial installation, Reliabil. Eng. Syst. Safe., 94, 1057–1063, 2009.</mixed-citation></ref>
      <ref id="bib1.bibx5"><?xmltex \def\ref@label{{Gustavsson et~al.(2014)Gustavsson, Patriksson, Str{\"{o}}mberg,
Wojciechowski, and {\"{O}}nnheim}}?><label>Gustavsson et al.(2014)Gustavsson, Patriksson, Strömberg,
Wojciechowski, and Önnheim</label><?label gustavsson2014preventive?><mixed-citation>
Gustavsson, E., Patriksson, M., Strömberg, A.-B., Wojciechowski, A., and
Önnheim, M.: Preventive maintenance scheduling of multi-component systems
with interval costs, Comput. Indust. Eng., 76, 390–400, 2014.</mixed-citation></ref>
      <ref id="bib1.bibx6"><?xmltex \def\ref@label{{Jafari et al. (2018)}}?><label>Jafari et al. (2018)</label><?label jafari2018joint?><mixed-citation>
Jafari, L., Naderkhani, F., and Makis, V.: Joint optimization of maintenance policy and inspection interval for a multi-unit series system using proportional hazards model, J. Operat. Res. Soc., 69, 36–48, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx7"><?xmltex \def\ref@label{{Lazard(2020)}}?><label>Lazard(2020)</label><?label lazard2020lazard?><mixed-citation>Lazard: Lazard's Levelized Cost of Energy Analysis – Version 14.0, available at: <uri>https://www.lazard.com/media/451419/lazards-levelized-cost-of-energy-version-140.pdf</uri> (last access: 18 June 2021), 2020.</mixed-citation></ref>
      <ref id="bib1.bibx8"><?xmltex \def\ref@label{{Lee and Cha(2016)}}?><label>Lee and Cha(2016)</label><?label lee2016new?><mixed-citation>
Lee, H. and Cha, J. H.: New stochastic models for preventive maintenance and
maintenance optimization, Eur. J. Oper. Res., 255, 80–90, 2016.</mixed-citation></ref>
      <ref id="bib1.bibx9"><?xmltex \def\ref@label{{Moghaddam and Usher(2011)}}?><label>Moghaddam and Usher(2011)</label><?label moghaddam2011sensitivity?><mixed-citation>
Moghaddam, K. S. and Usher, J. S.: Sensitivity analysis and comparison of
algorithms in preventive maintenance and replacement scheduling optimization
models, Comput. Indust. Eng., 61, 64–75, 2011.</mixed-citation></ref>
      <ref id="bib1.bibx10"><?xmltex \def\ref@label{{Sarker and Faiz(2016)}}?><label>Sarker and Faiz(2016)</label><?label sarker2016minimizing?><mixed-citation>
Sarker, B. R. and Faiz, T. I.: Minimizing maintenance cost for offshore wind
turbines following multi-level opportunistic preventive strategy, Renew. Energ., 85, 104–113, 2016.</mixed-citation></ref>
      <ref id="bib1.bibx11"><?xmltex \def\ref@label{{Stehly and Beiter(2020)}}?><label>Stehly and Beiter(2020)</label><?label stehly20202019?><mixed-citation>Stehly, T. J. and Beiter, P. C.: 2019 Cost of Wind Energy Review, Tech. rep.,
NREL – National Renewable Energy Lab., Golden, CO, USA, 2020.
 </mixed-citation></ref><?xmltex \hack{\newpage}?>
      <ref id="bib1.bibx12"><?xmltex \def\ref@label{{Tian et~al.(2011)Tian, Jin, Wu, and Ding}}?><label>Tian et al.(2011)Tian, Jin, Wu, and Ding</label><?label tian2011condition?><mixed-citation>
Tian, Z., Jin, T., Wu, B., and Ding, F.: Condition based maintenance
optimization for wind power generation systems under continuous monitoring,
Renew. Energ., 36, 1502–1509, 2011.</mixed-citation></ref>
      <ref id="bib1.bibx13"><?xmltex \def\ref@label{{Tian et~al.(2014)Tian, Wu, and Chen}}?><label>Tian et al.(2014)Tian, Wu, and Chen</label><?label tian2014condition?><mixed-citation>
Tian, Z., Wu, B., and Chen, M.: Condition-based maintenance optimization
considering improving prediction accuracy, J. Oper. Res. Soc., 65, 1412–1422, 2014.</mixed-citation></ref>
      <ref id="bib1.bibx14"><?xmltex \def\ref@label{{Werbi\'{n}ska-Wojciechowska(2019)}}?><label>Werbińska-Wojciechowska(2019)</label><?label werbinska2019technical?><mixed-citation>
Werbińska-Wojciechowska, S.: Technical system maintenance, Delay-time-based modelling, Springer International Publishing, Cham, Switzerland, 2019.</mixed-citation></ref>
      <ref id="bib1.bibx15"><?xmltex \def\ref@label{{Yu(2021a)}}?><label>Yu(2021a)</label><?label Yu2021a?><mixed-citation>Yu, Q.: NextPM-model/matlab, Github, available at: <uri>https://github.com/QuanjiangYu/NextPM-model/tree/main/matlab</uri> (last access: 18 June 2021), 2021a.</mixed-citation></ref>
      <ref id="bib1.bibx16"><?xmltex \def\ref@label{{Yu(2021b)}}?><label>Yu(2021b)</label><?label Yu2021b?><mixed-citation>Yu, Q.: NextPM-model/ampl, Github, available at: <uri>https://github.com/QuanjiangYu/NextPM-model/tree/main/ampl</uri> (last access: 18 June 2021), 2021b.</mixed-citation></ref>
      <ref id="bib1.bibx17"><?xmltex \def\ref@label{{Yu(2021c)}}?><label>Yu(2021c)</label><?label Yu2021c?><mixed-citation>Yu, Q.: NextPM-model/data, Github, available at: <uri>https://github.com/QuanjiangYu/NextPM-model/tree/main/data</uri> (last access: 18 June 2021), 2021c.</mixed-citation></ref>

  </ref-list></back>
    <!--<article-title-html>Optimal scheduling of the next preventive  maintenance activity for a wind farm</article-title-html>
<abstract-html><p>A large part of the operational cost for a wind farm is due to the cost of  equipment maintenance, especially for offshore wind farms. How to reduce the maintenance cost, and hence increase profitability, is this article's focus. It presents a binary linear optimization model whose solution may inform the wind turbine owners about which components, and when, should undergo the next preventive maintenance (PM) replacements. The suggested short-term scheduling strategy takes into account eventual failure events of the multi-component system – in that after the failed system is repaired, the previously scheduled PM plan should be updated, assuming that the restored components are as good as new.</p><p>The optimization algorithm of this paper, NextPM, is tested through numerical case studies applied to a four-component model of a wind turbine. The first study addresses the important case of a single component system, used for parameter calibration purposes. The second study analyses the case of seasonal variations of mobilization costs, as compared to the constant mobilization cost setting. Among other things, this analysis reveals a 35&thinsp;% cost reduction achieved by the NextPM model, as compared to the pure corrective maintenance (CM) strategy. The third case study compares the NextPM model with another optimization model – the preventive maintenance scheduling problem with interval costs (PMSPIC), which was the major source of inspiration for this article. This comparison demonstrates that the NextPM model is accurate and much faster in terms of computational time.</p></abstract-html>
<ref-html id="bib1.bib1"><label>Andreasson et al.(2020)Andreasson, Patriksson, and
Evgrafov</label><mixed-citation>
Andreasson, N., Patriksson, M., and Evgrafov, A.: An introduction to continuous optimization: foundations and fundamental algorithms, Courier Dover Publications, Dover, 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib2"><label>Browell et al.(2016)Browell, Dinwoodie, and
McMillan</label><mixed-citation>
Browell, J., Dinwoodie, I., and McMillan, D.: Forecasting for day-ahead
offshore maintenance scheduling under uncertainty, in: Proceedings of the
European Safety and Reliability (ESREL) Conference, September 2016, University of Strathclyde, Strathclyde, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib3"><label>Grimmett and Stirzaker(2020)</label><mixed-citation>
Grimmett, G. and Stirzaker, D.: Probability and random processes, Oxford University Press, Oxford, 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib4"><label>Guo et al.(2009)Guo, Watson, Tavner, and Xiang</label><mixed-citation>
Guo, H., Watson, S., Tavner, P., and Xiang, J.: Reliability analysis for wind
turbines with incomplete failure data collected from after the date of initial installation, Reliabil. Eng. Syst. Safe., 94, 1057–1063, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib5"><label>Gustavsson et al.(2014)Gustavsson, Patriksson, Strömberg,
Wojciechowski, and Önnheim</label><mixed-citation>
Gustavsson, E., Patriksson, M., Strömberg, A.-B., Wojciechowski, A., and
Önnheim, M.: Preventive maintenance scheduling of multi-component systems
with interval costs, Comput. Indust. Eng., 76, 390–400, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib6"><label>Jafari et al. (2018)</label><mixed-citation>
Jafari, L., Naderkhani, F., and Makis, V.: Joint optimization of maintenance policy and inspection interval for a multi-unit series system using proportional hazards model, J. Operat. Res. Soc., 69, 36–48, 2018.
</mixed-citation></ref-html>
<ref-html id="bib1.bib7"><label>Lazard(2020)</label><mixed-citation>
Lazard: Lazard's Levelized Cost of Energy Analysis – Version 14.0, available at: <a href="https://www.lazard.com/media/451419/lazards-levelized-cost-of-energy-version-140.pdf" target="_blank"/> (last access: 18 June 2021), 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib8"><label>Lee and Cha(2016)</label><mixed-citation>
Lee, H. and Cha, J. H.: New stochastic models for preventive maintenance and
maintenance optimization, Eur. J. Oper. Res., 255, 80–90, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib9"><label>Moghaddam and Usher(2011)</label><mixed-citation>
Moghaddam, K. S. and Usher, J. S.: Sensitivity analysis and comparison of
algorithms in preventive maintenance and replacement scheduling optimization
models, Comput. Indust. Eng., 61, 64–75, 2011.
</mixed-citation></ref-html>
<ref-html id="bib1.bib10"><label>Sarker and Faiz(2016)</label><mixed-citation>
Sarker, B. R. and Faiz, T. I.: Minimizing maintenance cost for offshore wind
turbines following multi-level opportunistic preventive strategy, Renew. Energ., 85, 104–113, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib11"><label>Stehly and Beiter(2020)</label><mixed-citation>
Stehly, T. J. and Beiter, P. C.: 2019 Cost of Wind Energy Review, Tech. rep.,
NREL – National Renewable Energy Lab., Golden, CO, USA, 2020.

</mixed-citation></ref-html>
<ref-html id="bib1.bib12"><label>Tian et al.(2011)Tian, Jin, Wu, and Ding</label><mixed-citation>
Tian, Z., Jin, T., Wu, B., and Ding, F.: Condition based maintenance
optimization for wind power generation systems under continuous monitoring,
Renew. Energ., 36, 1502–1509, 2011.
</mixed-citation></ref-html>
<ref-html id="bib1.bib13"><label>Tian et al.(2014)Tian, Wu, and Chen</label><mixed-citation>
Tian, Z., Wu, B., and Chen, M.: Condition-based maintenance optimization
considering improving prediction accuracy, J. Oper. Res. Soc., 65, 1412–1422, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib14"><label>Werbińska-Wojciechowska(2019)</label><mixed-citation>
Werbińska-Wojciechowska, S.: Technical system maintenance, Delay-time-based modelling, Springer International Publishing, Cham, Switzerland, 2019.
</mixed-citation></ref-html>
<ref-html id="bib1.bib15"><label>Yu(2021a)</label><mixed-citation>
Yu, Q.: NextPM-model/matlab, Github, available at: <a href="https://github.com/QuanjiangYu/NextPM-model/tree/main/matlab" target="_blank"/> (last access: 18 June 2021), 2021a.
</mixed-citation></ref-html>
<ref-html id="bib1.bib16"><label>Yu(2021b)</label><mixed-citation>
Yu, Q.: NextPM-model/ampl, Github, available at: <a href="https://github.com/QuanjiangYu/NextPM-model/tree/main/ampl" target="_blank"/> (last access: 18 June 2021), 2021b.
</mixed-citation></ref-html>
<ref-html id="bib1.bib17"><label>Yu(2021c)</label><mixed-citation>
Yu, Q.: NextPM-model/data, Github, available at: <a href="https://github.com/QuanjiangYu/NextPM-model/tree/main/data" target="_blank"/> (last access: 18 June 2021), 2021c.
</mixed-citation></ref-html>--></article>
