• Graduate Programs
  • Research
  • Browse our Courses
  • Events
    • Events Calendar
    • Events Archive
    • Summer School
      • Applied Public Policy Evaluation
      • Deep Learning
      • Development Economics
      • Economics of Blockchain and Digital Currencies
      • Economics of Climate Change
      • The Economics of Crime
      • Foundations of Machine Learning with Applications in Python
      • From Preference to Choice: The Economic Theory of Decision-Making
      • Inequalities in Health and Healthcare
      • Marketing Research with Purpose
      • Markets with Frictions
      • Modern Toolbox for Spatial and Functional Data
      • Sustainable Finance
      • Tuition Fees and Payment
      • Business Data Science Summer School Program
    • Tinbergen Institute Lectures
    • 2026 Tinbergen Institute Opening Conference
    • Annual Tinbergen Institute Conference
  • News
  • Summer School
    • Applied Public Policy Evaluation
    • Deep Learning
    • Development Economics
    • Economics of Blockchain and Digital Currencies
    • Economics of Climate Change
    • The Economics of Crime
    • Foundations of Machine Learning with Applications in Python
    • From Preference to Choice: The Economic Theory of Decision-Making
    • Inequalities in Health and Healthcare
    • Marketing Research with Purpose
    • Markets with Frictions
    • Modern Toolbox for Spatial and Functional Data
    • Sustainable Finance
    • Tuition Fees and Payment
  • Alumni

Dekker, R. and Smeitink, E. (1991). Opportunity-based block replacement European Journal of Operational Research, 53(1):46--63.


  • Journal
    European Journal of Operational Research

In this paper we consider a block replacement model in which a component can be replaced preventively at maintenance opportunities only. Maintenance opportunities occur randomly and are modelled through a renewal process. In the first, theoretical part of the paper we derive an optimality equation and show that the optimal opportunity block replacement policy can be described as a so-called one-opportunity-look-ahead policy. In the second, computational part we present an exact optimisation algorithm in case of K2-distributed times between opportunities. This algorithm can also be used as an approximative method in case of other times between opportunity distributions. Together with another approximative method, based on the stationary forward recurrence time distribution, its performance is checked with simulation.