Dynamic scheduling of a two-class queue with setups

Operations Research

Volumn 46, Issue 4, 1998, Pages 532-547

  Reiman, Martin I ^a   Wein, Lawrence M ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Production scheduling: stochastic scheduling with setups; Queues: diffusion models of control problems

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; COSTS; INDUSTRIAL APPLICATIONS; PROBLEM SOLVING; PRODUCTION CONTROL; QUEUEING THEORY; SCHEDULING;

DIFFUSION CONTROL PROBLEMS; DYNAMIC SCHEDULING;

OPERATIONS RESEARCH;

EID: 0032115326     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.46.4.532     Document Type: Article

References (25)

1. BERTSIMAS, D. AND H. XU. 1993. Optimization of Polling Systems and Dynamic Vehicle Routing Problems on Networks. Sloan School of Management, MIT, Cambridge, MA.
2. BOXMA, O. J., H. LEVY, AND J. A. WESTRATE. 1991. Efficient Visit Frequencies for Polling Tables: Minimization of Waiting Cost. Queueing Systems, 9, 133-162.
3. BOXMA, O. J. AND H. TAKAGI. 1992. Editors, Special Issue on Polling Systems. Queueing Systems, 11, 1 and 2.
4. BROWNE, S. AND U. YECHIALI. 1989. Dynamic Priority Rules for Cyclic-Type Queues. Adv., in Appl. Probab. 21, 432-450.
5. CHEVALIER, P. B. AND L. M. WEIN. 1993. Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network. Opns. Res. 41, 743-758.
6. COFFMAN, E. G., JR., A. A. PUHALSKII, AND M. I. REIMAN. 1995. Polling Systems with Zero Switchover Times: A Heavy-Traffic Averaging Principle. Ann. Appl. Probab. 5, 681-719.
7. COFFMAN, E. G., JR., A. A. PUHALSKII, AND M. I. REIMAN. 1998. Polling Systems in Heavy-Traffic: A Bessel Process Limit. To appear in Math. Opns. Res.
8. DUENYAS, I. AND M. P. VAN OYEN. 1995. Stochastic Scheduling of Parallel Queues with Setup Costs. Queueing Systems, 19, 421-444.
9. ELMAGHRABY, S. E. 1978. The Economic Lot Scheduling Problem (ELSP): Review and Extensions. Mgmt. Sci. 24, 587-598.
10. FOSCHINI, G. J. 1977. On Heavy Traffic Diffusion Analysis and Dynamic Routing in Packet Switched Networks. In Computer Performance. K. M. Chandy and M. Reiser (eds.). North-Holland, Amsterdam.
11. HARRISON, J. M. 1985. Brownian Motion and Stochastic Flow Systems. John Wiley, New York.
12. HARRISON, J. M. 1988. Brownian Models of Queueing Networks With Heterogeneous Customer Populations. In Stochastic Differential Systems, Stochastic Control Theory and Applications, IMA Volume 10. W. Fleming and P. L. Lions (eds.), Springer-Verlag, New York, 147-186.
13. HARRISON, J. M. AND L. M. WEIN. 1990. Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network. Opns. Res. 38, 1052-1064.
14. HOFRI, M. AND K. W. ROSS. 1987. On the Optimal Control of Two Queues with Server Set-up Times and its Analysis. SIAM J. Comput. 16, 399-420.
15. IGLEHART, D. L. AND W. WHITT. 1970. Multiple Channel Queues in Heavy Traffic, I and II. Adv. in Appl. Probab. 2, 150-177 and 355-364.
16. KOOLE, G. 1994. Assigning a Single Server to Inhomogeneous Queues with Switching Costs. To appear in Theoretical Computer Sci.
17. KUSHNER, H. J. AND P. G. DUPUIS. 1992. Numerical Methods for Stochastic Control Problems in Continuous Time. Springer-Verlag, New York.
18. LIU, Z., P. NAIN, AND D. TOWSLEY. 1992. On Optimal Polling Policies. Queueing Systems, 11, 59-83.
19. MANDL, P. 1968. Analytical Treatment of One-Dimensional Markov Processes. Springer-Verlag, New York.
20. MARKOWITZ, D. 1996. A Unified Approach to Single Machine Scheduling: Heavy Traffic Analysis of Dynamic Cyclic Policies. Ph.D. thesis, Sloan School of Management, MIT, Cambridge, MA. In preparation.
21. REIMAN, M. I. AND L. M. WEIN. 1994. Dynamic Scheduling of a Two-Class Queue with Setups. Technical Report, Sloan School of Management, MIT, Cambridge, MA.
22. TAKAGI, H. 1986. Analysis of Polling Systems. The MIT Press, Cambridge, MA.
23. VAN OYEN, M. P. AND I. DUENYAS. 1996. Heuristic Scheduling of Parallel Heterogeneous Queues with Set-ups. Mgmt. Sci. 42, 817-829.
24. WEIN, L. M. 1990a. Optimal Control of a Two-Station Brownian Network. Math. O. R. 15, 215-242.
25. WEIN, L. M. 1990b. Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network With Controllable Inputs. Opns. Res. 38, 1065-1078.