Premium
Coordinated overhaul scheduling of production units
Author(s) -
Hariga Moncer
Publication year - 1994
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199406)41:4<565::aid-nav3220410408>3.0.co;2-q
Subject(s) - scheduling (production processes) , computer science , mathematical optimization , schedule , production (economics) , production schedule , interval (graph theory) , time complexity , operations research , algorithm , mathematics , economics , combinatorics , macroeconomics , operating system
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 near‐optimal 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. © 1994 John Wiley & Sons, Inc.