Premium
Optimal maintenance policies for serial, multi‐machine systems with non‐instantaneous repairs
Author(s) -
Maillart Lisa M.,
Fang Xiang
Publication year - 2006
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/nav.20171
Subject(s) - throughput , computer science , mathematical optimization , equivalence (formal languages) , budget constraint , constraint (computer aided design) , nonlinear system , steady state (chemistry) , state (computer science) , operations research , algorithm , mathematics , economics , operating system , chemistry , physics , geometry , neoclassical economics , discrete mathematics , quantum mechanics , wireless
We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006