DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click HERE
to register or log in.
Dynamic Scheduling of a Multi-Class Queue I: Problem Formulation and Descriptive Results.
STANFORD UNIV CALIF DEPT OF OPERATIONS RESEARCH
Pagination or Media Count:
The author considers an MG1 queue with several customer classes. It is not required that the queue be stable or even that the mean service time be finite for any class. The economic framework is linear, featuring a holding cost per unit time and fixed service reward for each class. Future costs and rewards are continuously discounted using a positive interest rate. The problem is to decide, at the completion of each service and given the state of the system, which class to admit next. The objective is to maximize expected net present value over an infinite planning horizon. The problem is formulated as a Markov renewal decision process. One very special type of scheduling rule, called a static policy, simply enforces a specified priority ranking. The return function under a static policy is explicity presented. In a subsequent paper it will be shown that there exists a static optimal policy. Author
APPROVED FOR PUBLIC RELEASE