The Policy Space Structure of Markovian Systems with Two Types of Service

Israel Brosh
Additional contact information
Israel Brosh: Newark College of Engineering

Management Science, 1970, vol. 16, issue 9, 607-621

Abstract: A system with customers demanding service is observed at equally spaced points in time. Two types of service can be applied and the maximum number of customers the system can accommodate is L. The probability for an arrival of a customer per period is assumed to be \lambda, and the probability to finish its service in one period will be \mu k (k - 1, 2). Different costs are imposed on the system for using a certain type of service as well as for a customer lost. The implementation of a particular service policy generates a Markov process. The policy space structure and its relationship to the variants of the system (costs, probability to finish service in a unit of time, and arrivals) is presented. The analysis shows that it is possible to reduce the number of policies to be considered from 2 L+1 to L + 2, and a simple algorithm is proposed for choosing the optimal policy.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.9.607 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:16:y:1970:i:9:p:607-621

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().