Coordinated overhaul scheduling of production units

Moncer Hariga

Naval Research Logistics (NRL), 1994, vol. 41, issue 4, 565-577

Abstract: 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.

Date: 1994
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199406)41:43.0.CO;2-Q

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:41:y:1994:i:4:p:565-577

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().