Coordinated overhaul scheduling of production units

✍ Scribed by Moncer Hariga

• Publisher: John Wiley and Sons
• Year: 1994
• Tongue: English
• Weight: 539 KB
• Volume: 41
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/1520-6750(199406)41:4<565::aid-nav3220410408>3.0.co;2-q

✦ Synopsis

This article presents a new approach to solve the problem of coordinating the overhaul scheduling of several nonidentical production units. For each production unit, we assume that the operating cost is an n-order polynomial function of the time elapsed since its previous overhaul. We develop an efficient iterative algorithm that generates a nearoptimal cyclic overhaul schedule. We also construct a simple algorithm for the case where the overhaul interval for each production unit and the cycle time are restricted to be power-of-two multiples of some base planning period. Finally, we provide a worst-case performance bound for the solution to the problem under the power-of-two restriction.