Computing Reviews

M/M/1 queueing systems with inventory
Schwarz M., Sauer C., Daduna H., Kulik R., Szekli R. Queueing Systems: Theory and Applications54(1):55-78,2006.Type:Article
Date Reviewed: 03/27/07

Running out of inventory creates lost sales on one side, and a potential for losing customers on the other. The former is studied in inventory theory, and the latter in queueing theory. This paper combines both inventory management and customer queueing, and presents explicit performance measures for service systems with attached inventories. Many results are presented, including those on optimal policies in classes of feasible policies for minimizing the ratio of queue size to inventory size. In particular, Markovian/Markovian/one (M/M/1) queues with inventories and variants of systems and policies are investigated.

The paper has a traditional mathematical structure, with definitions, theorems, and proofs (some in Appendix B). Researchers in queueing theory are the intended readers. Numerous remarks and examples help readers understand the practical interpretations and ramifications of the results. Additionally, Appendix A expands the discussion with more systems and policies, making this an interesting paper both for researchers and practitioners.

Reviewer:  Jerzy W. Jaromczyk Review #: CR134081

Reproduction in whole or in part without permission is prohibited.   Copyright 2024 ComputingReviews.com™
Terms of Use
| Privacy Policy