Heuristic scheduling of parallel heterogeneous queues with set-ups

被引:34
作者
Duenyas, I [1 ]
VanOyen, MP [1 ]
机构
[1] NORTHWESTERN UNIV,DEPT IND ENGN & MANAGEMENT SCI,EVANSTON,IL 60208
关键词
stochastic scheduling; production/inventory; production control; polling systems;
D O I
10.1287/mnsc.42.6.814
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the problem of allocating a single server to a system of queues with Poisson arrivals. Each queue represents a class of jobs and possesses a holding cost rate, general service distribution, and general set-up time distribution. The objective is to minimize the expected holding cost due to the waiting of jobs. A set-up time is required to switch from one queue to another. We provide a limited characterization of the optimal policy and a simple heuristic scheduling policy for this problem. Simulation results demonstrate the effectiveness of our heuristic over a wide range of problem instances.
引用
收藏
页码:814 / 829
页数:16
相关论文
共 37 条
[1]  
Altman E., 1992, Queueing Systems Theory and Applications, V11, P35, DOI 10.1007/BF01159286
[2]  
[Anonymous], 1982, DETERMINISTIC STOCHA
[3]   POLLING WITH A GENERAL-SERVICE ORDER TABLE [J].
BAKER, JE ;
RUBIN, I .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1987, 35 (03) :283-288
[4]   K COMPETING QUEUES WITH GEOMETRIC SERVICE REQUIREMENTS AND LINEAR COSTS - THE MU-C-RULE IS ALWAYS OPTIMAL [J].
BARAS, JS ;
MA, DJ ;
MAKOWSKI, AM .
SYSTEMS & CONTROL LETTERS, 1985, 6 (03) :173-180
[6]   DYNAMIC PRIORITY RULES FOR CYCLIC-TYPE QUEUES [J].
BROWNE, S ;
YECHIALI, U .
ADVANCES IN APPLIED PROBABILITY, 1989, 21 (02) :432-450
[7]   THE C-MU RULE REVISITED [J].
BUYUKKOC, C ;
VARAIYA, P ;
WALRAND, J .
ADVANCES IN APPLIED PROBABILITY, 1985, 17 (01) :237-238
[8]  
Conway RW., 1967, THEORY SCHEDULING
[9]  
Cox D. R., 1960, QUEUES
[10]  
FEDERGRUEN A, 1993, IMPACT SETUP TIMES P