Loading…

Analysis and computation of ( n, N)-strategies for maintenance of a two-component system

In this paper ( n, N)-strategies are investigated for the maintenance of a two component series system. Vergin and Scriabin [8] provided some numerical evidence on the near-optimality of this type of policies. In a recent paper, Özekici [5] gave a characterization of the structure of the optimal pol...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1990-09, Vol.48 (2), p.260-274
Main Authors: van der Duyn Schouten, F.A., Vanneste, S.G.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper ( n, N)-strategies are investigated for the maintenance of a two component series system. Vergin and Scriabin [8] provided some numerical evidence on the near-optimality of this type of policies. In a recent paper, Özekici [5] gave a characterization of the structure of the optimal policy and its possible deviations from the ( n, N)-structure for the discounted cost criterion. The same kind of structure is shown to hold for the average cost criterion. In view of the complicated form of the optimal policy and the near-optimality of the ( n, N)-policies we present a fast computational method to compute the average costs under a given ( n, N)-policy. This method is based on a well-known embedding technique. Moreover, a heuristic based on this computational method, is presented by which the optimal values of n and N can be determined.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(90)90379-P