Abstract
In this paper, an inventory oxygen-bottles problem is formulated as (i) an (M/M/C):(GD/N/∞) queueing model with different service rates; (ii) a probabilistic goal programming (PGP) model. By using the first model, the optimum required rate for oxygen bottles to be stored is determined. By using the second model, the decision-maker can determine his policy, which minimizes the total cost. Finally, a case study of the storage of oxygen bottles for the Egyptian Air Force (1980-1984) is presented.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
El-Dash, A. Two Probabilistic Models for Solving an Oxygen-bottle Inventory Problem. J Oper Res Soc 40, 961–969 (1989). https://doi.org/10.1057/jors.1989.169
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1989.169