Article ID: | iaor2001602 |
Country: | United Kingdom |
Volume: | 27 |
Issue: | 6 |
Start Page Number: | 539 |
End Page Number: | 558 |
Publication Date: | May 2000 |
Journal: | Computers and Operations Research |
Authors: | Wang W. |
Keywords: | programming: branch and bound, maintenance, repair & replacement |
Although much has been published concerning the optimality of a single‐type inspection process, relatively little attention has been paid in the literature of maintenance modelling to the practice of multiple nested inspections. In this paper a novel model addressing multiple nested inspections of production plant at different intervals is established based upon the delay time concept. A branch‐and‐bound algorithm is developed for finding the optimal intervals for all the inspections which minimizes the long‐term expected total cost per unit time. The modelling can be readily extended to model downtime or reliability. Necessary mathematics is presented and proofs are given. A numerical example is also given to illustrate the modelling and solution processes.