A note on parallel machine replacement

Jen Tang and Kwei Tang

Naval Research Logistics (NRL), 1993, vol. 40, issue 4, 569-573

Abstract: Jones, Zydiak, and Hopp [1] consider the parallel machine replacement problem (PMRP), in which there are both fixed and variable costs associated with replacing machines. Increasing maintenance cost motivates replacements, and a fixed replacement cost provides incentive for replacing machines of the same age in clusters. They prove two intuitive but important results for finite‐ or infinite‐horizon PMRPs, which significantly reduce the size of the linear programming (LP) formulation of the problem and computing efforts required to obtain an optimal replacement policy. Their results are the no‐splitting rule (NSR) and the older cluster replacement rule (OCRR). Under a slightly weaker set of assumptions, we prove a third rule, the all‐or‐none rule (AONR), which states that in any period, an optimal policy is to keep or to replace all the machines regardless of age. This result further reduces the size of the LP formulation of the PMRP. © 1993 John Wiley & Sons, Inc.

Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199306)40:43.0.CO;2-F

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:40:y:1993:i:4:p:569-573

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 ().