Author:
Weichbold Josef,Schiefermayr Klaus
Abstract
We consider a scheduling problem with two interconnected queues and
two flexible servers. It is assumed that all jobs are present at the
beginning and that there are no further arrivals to the system at any
time. For each job, there are waiting costs per unit of time until the job
leaves the system. A job of queue 1, after being served, joins queue 2
with probability p and leaves the system with probability 1
− p. The objective is how to allocate the two servers to
the queues such that the expected total holding costs until the system is
empty are minimized. We give a sufficient condition such that for any
number of jobs in queue 1 and queue 2, it is optimal to allocate both
servers to queue 1 (resp. queue 2).
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Reference7 articles.
1. Schiefermayr, K. & Weichbold, J. (2005).A complete solution for the optimal stochastic scheduling of atwo-stage tandem queue with two flexible servers.Journal of Applied Probability 42:778–796.
2. Chang, C.S. , Nelson, R. , & Pinedo, M. (1991).Scheduling two classes of exponential jobs on parallel processors:Structural results and worst-case analysis.Advances in Applied Probability 23:925–944.
3. Schiefermayr, K. & Weichbold, J. (2006).A scheduling problem of several parallel servers(submitted).
4. Ahn, H. , Duenyas, I. , & Zhang, R.Q. (1999).Optimal stochastic scheduling of a two-stage tandem queue withparallel servers.Advances in Applied Probability 31:1095–1117.
5. Ross, S. (1983).Introduction to stochastic dynamic programming.New York:Academic Press.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献