A practical scheduling method for multiclass production systems with setups

Management Science

Volumn 45, Issue 1, 1999, Pages 116-130

  Olsen, Tava Lennon ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Changeovers; Heuristics; Manufacturing; Polling; Queueing

Indexed keywords

DECISION THEORY; HEURISTIC METHODS; PROCESS CONTROL; QUEUEING THEORY; SCHEDULING; STATISTICAL METHODS;

MULTICLASS PRODUCTION SYSTEMS; WAITING-TIME VARIANCE;

PRODUCTION CONTROL;

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

References (24)

1. Ayhan, H., T. L. Olsen. 1997. Scheduling of multi-class single-server queues under nontraditional performance measures. To appear Oper. Res.
2. Boxma, O., H. Levy, J. Weststrate. 1990. Optimization of polling systems. Performance '90. P. J. B. King, I. Mitrani, and R. J. Pooley, eds. Elsevier Science Publishers B.V., North-Holland, Amsterdam.
3. _, _, _. 1991. Efficient visit frequencies for polling tables: minimization of waiting cost. Queueing Systems Theory Appl. 9 133-162.
4. Browne, S., U. Yechiali. 1989. Dynamic priority rules for cyclic type queues. Adv. Appl. Probab. 21 432-450.
5. Buzacott, J. A., J. G. Shanthikumar. 1993. Stochastic Models of Manufacturing Systems. Prentice-Hall, Englewood Cliffs, NJ.
6. Cooper, R. B., S. Niu, M. M. Srinivasan. 1997. Setups in polling models: Does it make sense to set up if no work is waiting? To appear in J. Appl. Probab.
7. Duenyas, I., M. Van Oyen. 1996. Heuristic scheduling of parallel heterogeneous queues with set-ups. Management Sci. 42 814-829.
8. Fuhrmann, S. W., R. B. Cooper. 1985. Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. 33 1117-1129.
9. Hofri, M., 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.
10. Kekre, S., K. Srinivasan. 1990. Broader product line: A necessity to achieve success? Management Sci. 36 1216-1231.
11. Law, A. M., W. D. Keltori. 1991. Simulation Modeling & Analysis. McGraw-Hill, New York.
12. Lennon, T. M. 1994. Response-Time Approximations for Multi-Server Polling Models, with Manufacturing Applications. PhD Thesis, Stanford University, Stanford, CA.
13. Liu, Z., P. Nain, D. Towsley. 1992. On optimal polling policies. Queueing Systems Theory and Appl. 11 59-84.
14. Mũnoz, D. 1991. Cancellation methods in the analysis of simulation output. PhD Thesis, Stanford University, Stanford, CA.
15. Markowitz, D. M. 1996. A Unified Treatment of the Single Machine Scheduling Problem in a Dynamic Stochastic Environment. PhD Thesis. M.I.T., Cambridge, MA.
16. Nahmias, S. 1993. Production and Operations Analysis. 2nd ed. Irwin, Homewood, IL.
17. Olsen, T. L. 1996. Asymptotics for polling models with increasing setups. Under submission.
18. Pinedo, M. 1995. Scheduling Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs, NJ.
19. Reiman, M. I., L. M. Wein. 1998. Dynamic scheduling of a two-class queue with setups. Oper. Res. 4 532-547.
20. Takagi, H. 1986. Analysis of Polling Systems. MIT Press, Cambridge, MA.
21. _, Ed. 1990. Stochastic Analysis of Computer and Communication Systems. Chapter 1. Elsevier Science Publishers B.V. North-Holland, Amsterdam.
22. Van Mieghem, J. A. 1995. Dynamic scheduling with convex delay costs: the generalized c-mu rule. Ann. Appl. Prob. 5 808-833.
23. Webster, S., K. R. Baker. 1995. Scheduling groups of jobs on a single machine. Oper. Res. 43 692-703.
24. Wolff, R. W. 1989. Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs, NJ.