DYNAMIC SCHEDULING OF A MULTICLASS MAKE-TO-STOCK QUEUE

被引:105
作者
WEIN, LM
机构
关键词
D O I
10.1287/opre.40.4.724
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Motivated by make-to-stock production systems, we consider a scheduling problem for a single server queue that can process a variety of different job classes. After jobs are processed, they enter a finished goods inventory that services customer demand. The scheduling problem is to dynamically decide which job class, if any, to serve next in order to minimize the long-run expected average cost incurred per unit of time, which includes linear costs (which may differ by class) for backordering and holding finished goods inventory. Under the heavy traffic condition that the server must be busy the great majority of the time in order to satisfy customer demand, the scheduling problem is approximated by a dynamic control problem involving Brownian motion. The Brownian control problem is solved, and its solution is interpreted in terms of the queueing system to obtain a scheduling policy. A simulation experiment is performed that demonstrates the policy's effectiveness.
引用
收藏
页码:724 / 735
页数:12
相关论文
共 15 条
[1]   TRANSIENT-BEHAVIOR OF REGULATED BROWNIAN-MOTION .2. NONZERO INITIAL CONDITIONS [J].
ABATE, J ;
WHITT, W .
ADVANCES IN APPLIED PROBABILITY, 1987, 19 (03) :599-631
[2]  
BEMELMANS R, 1982, CAPACITY ORIENTED AP
[3]  
Billingsley P, 1968, CONVERGENCE PROBABIL
[4]  
GAVISH B, 1977, OPER RES, V28, P1228
[5]   THE MULTI-PRODUCT PRODUCTION CYCLING PROBLEM [J].
GRAVES, SC .
AIIE TRANSACTIONS, 1980, 12 (03) :233-240
[6]  
Harrison J.M., 1985, BROWNIAN MOTION STOC
[7]  
HARRISON JM, 1988, STOCHASTIC DIFFERENT, V10, P147
[8]  
Klimov G. P., 1974, Theory of Probability and Its Applications, V19, P532, DOI 10.1137/1119060
[9]  
Menaldi JL, 1984, LECTURE NOTES CONTRO, V59, P424
[10]  
MEYER P. A., 1976, LECT NOTES MATH, V511, P245, DOI [10.1007/978-3-540-45530-1_11, DOI 10.1007/978-3-540-45530-1_11]