Article
Modeling Deterministic Opportunistic Replacement as an Integer Programming Problem
American Journal of Mathematical and Management Sciences
(1990)
Abstract
The field of opportunistic replacement deals with the benefits of performing maintenance on equipment prior to failure in order to avoid prohibitively high costs associated with failure. Problems of a deterministic nature, i.e., where the exact times of both mandatory replacement and maintenance opportunities are known at the outset, with infinite time horizons have been solved for the two component case using a specialized algorithm. This paper presents a more general integer programming formulation of the problem that will work for any specified time frame. The results are of theoretical as well as practical significance in solving problems such as maintenance scheduling in fusion power plants.
Keywords
- deterministic opportunistic replacement,
- two component problem,
- Integer Programming formulation,
- finite time horizon
Disciplines
Publication Date
1990
DOI
10.1080/01966324.1990.10737288
Citation Information
Bernard Dickman, Yonah Wilamowsky and Sheldon Epstein. "Modeling Deterministic Opportunistic Replacement as an Integer Programming Problem" American Journal of Mathematical and Management Sciences Vol. 10 Iss. 3-4 (1990) p. 323 - 339 ISSN: 2325-8454 Available at: http://works.bepress.com/yonah-wilamowsky/10/