Heuristic scheduling of parallel heterogeneous queues with set-ups

Management Science

Volumn 42, Issue 6, 1996, Pages 814-829

  Duenyas, Izak ^a   Van Oyen, Mark P ^a  

^a NONE

Author keywords

Polling Systems; Production Control; Production Inventory; Stochastic Scheduling

Indexed keywords

EID: 0001514851     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.42.6.814     Document Type: Article

References (37)

1. Altman, E., P. Konstantopoulos and Z. Liu, "Stability, Monotonicity and Invariant Quantities in General Polling Systems," Queueing Systems, 11 (1992), 35-57.
2. Baker, J. E. and I. Rubin, "Polling with a General-service Order Table," IEEE Trans. Comm. COM-35 (1987), 283-288.
3. Baras, J. S., D. J. Ma and A. M. Makowski, "K Competing Queues with Geometric Service Requirements and Linear Costs: The μc Rule Is Always Optimal," Systems Control Letters, 6 (1985), 173-180.
4. Bell, C, "Characterization and Computation of Optimal Policies for Operating an M/G /1 Queueing System with Removable Server," Oper. Res., 19 (1971), 208-218.
5. Browne, S. and U. Yechiali, "Dynamic Priority Rules for Cyclic-type Queues," Advances in Applied Probability, 21 (1989), 432-450.
6. Buyukkoc, C., P. Varaiya and J. Walrand, "The cμ-rule Revisited," Advances in Applied Probability, 17 (1985), 237-238.
7. Conway, R. W., W. L. Maxwell and L. W. Miller, Theory of Scheduling, Addison-Wesley, Reading, MA, 1967.
8. Cox, D. R. and W. L. Smith, Queues, Methuen, London, 1960.
9. Dempster, M. A. H., J. K. Lenstra and A. M. G. Rinnooy Kan, Deterministic and Stochastic Scheduling, D. Reidel, Dordrecht, Holland, 1982.
10. Federgruen, A. and Z. Katalan, "The Stochastic Economic Lot Scheduling Problem: Cyclical Base-stock Policies with Idle Times," Working Paper, Graduate School of Business, Columbia University, New York, 1993a.
11. _ and _, "The Impact of Setup Times on the Performance of Multiclass Service and Production Systems," Working Paper, Graduate School of Business, Columbia University, New York, 1993b.
12. Georgiadis, L. and W. Szpankowski, "Stability of Token Passing Rings," Queueing Systems, 11 (1992), 7-34.
13. Gittins, J. C., Multi-armed Bandit Allocation Indices, Wiley, New York, 1989.
14. Gupta, D., Y. Gerchak and J. A. Buzacott, "On Optimal Priority Rules for Queues with Switchover Costs," Preprint, Department of Management Sciences, University of Waterloo, Canada, 1987.
15. Harrison, J. M., "A Priority Queue with Discounted Linear Costs," Oper. Res., 23 (1975a), 260-269.
16. _, "Dynamic Scheduling of a Multiclass Queue: Discount Optimality," Oper. Res., 23 (1975b), 270-282.
17. Hofri, M. and K. W. Ross, "On the Optimal Control of Two Queues with Server Set-up Times and Its Analysis," SJAM J. Computing, 16 (1987), 399-420.
18. Klimov, G. P., "Time Sharing Service Systems I," Theory of Probability and Its Applications, 19 (1974), 532-551.
19. _, "Time Sharing Service Systems III," Theory of Probability and Its Applications, 23 (1978), 314-321.
20. Kuehn, P. J., "Multiqueue Systems with Nonexhaustive Cyclic Service," Bell Syst. Tech. J., 58 (1979), 671-698.
21. Lai, T. L., and Z. Ying, "Open Bandit Processes and Optimal Scheduling of Queueing Networks," Advances in Applied Probability, 20 (1988), 447-472.
22. Levy, H. and M. Sidi, "Polling Systems: Applications, Modelling, and Optimization," IEEE Trans. Commun., 38 (1990), 1750-1760.
23. _, _ and O. J. Boxma, "Dominance Relations in Polling Systems," Queueing Systems, 6 (1990), 155-172.
24. Liu, Z., P. Nain and D. Towsley, "On Optimal Polling Policies," Queueing Systems (QUESTA), 11 (1992), 59-84.
25. Nain, P., "Interchange Arguments for Classical Scheduling Problems in Queues," Systems Control Letters, 12 (1989), 177-184.
26. _, P. Tsoucas and J. Walrand, "Interchange Arguments in Stochastic Scheduling," J. Applied Probability, 27 (1989), 815-826.
27. Rajan, R. and R. Agrawal, "Optimal Server Allocation in Homogeneous Queueing Systems with Switching Costs," Preprint, Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI, 1991.
28. Santos, C. and M. Magazine, "Batching in Single Operation Manufacturing Systems," Oper. Res. Letters, 4 (1985), 99-103.
29. Srinivasan, M. M., "Nondeterministic Polling Systems," Management Sd., 37 (1991), 667.
30. Takagi, H., "Priority Queues with Set-up Times," Oper. Res., 38 (1990), 667-677.
31. Van Oyen, M. P., "Optimal Stochastic Scheduling of Queueing Networks: Switching Costs and Partial Information," Ph.D. Thesis, University of Michigan, Ann Arbor, 1992.
32. _, D. G. Pandelis and D. Teneketzis, "Oprimality of Index Policies for Stochastic Scheduling with Switching Penalties," J. Appl. Prob., 29 (1992), 957-966.
33. _ and D. Teneketzis, "Optimal Stochastic Scheduling of Forest Networks with Switching Penalties," Adv. Appl. Prob., 26 (1994), 474-497.
34. Varaiya, P., J. Walrand and C. Buyukkoc, "Extensions of the Multiarmed Bandit Problem," IEEE Trans. Automatic Control, AC-30 (1985), 426-439.
35. Walrand, J., An Introduction to Queueing Networks, Prentice Hall, Englewood Cliffs, NJ, 1988.
36. Wein, L. M., "Due Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue," Management Sci., 37 (1991), 834-850.
37. _, and P. Chevalier, "A Broader View of the Job Shop Scheduling Problem," Management Sci., 38 (1992), 1018-1033.