Markovian queueing models with periodic-review

Markovian queueing models with periodic-review

0.00 Avg rating0 Votes
Article ID: iaor199772
Country: United Kingdom
Volume: 23
Issue: 8
Start Page Number: 741
End Page Number: 754
Publication Date: Aug 1996
Journal: Computers and Operations Research
Authors:
Keywords: inventory, queues: theory
Abstract:

This article concerns the production/inventory system with periodic-review policy. The system is modelled as an M/M/c-type of queue and is analysed by using the embedded Markov chain technique. The probability generating functions for the queue length are derived, which are used to determine the mean queue length, mean job waiting times, and higher monents of these quantities. Analytic results are obtained for M/M/1 queues and M/M/• queues with periodic-review. For M/M/c queues of 1<c<•, analytic solutions do not exist. Thus, numerical methods have to be applied. An optimization model is imposed on the queue m model that balances the inventory (wiating) cost and the cost of reviewing the system. The cost is minimized by determining the length of the review period. Both constant and state-dependent lengths of the review period are considered and compared. The optimal review periods are given for various numerical examples.

Reviews

Required fields are marked *. Your email address will not be published.