A Practical Scheduling Method for Multiclass Production Systems with Setups

References

• Ayhan H., Olsen T. L. Scheduling of multi-class single-server queues under nontraditional performance measures. Oper. Res (1997) . To appearGoogle Scholar
• Boxma O., Levy H., Weststrate J., King P. J. B., Mitrani I., Pooley R. J. Optimization of polling systems. Performance '90. (1990) (Elsevier Science Publishers B.V., North-Holland, Amsterdam) Google Scholar
• Boxma O., Levy H., Weststrate J. Efficient visit frequencies for polling tables: Minimization of waiting cost. Queueing Systems Theory Appl. (1991) 9:133–162Crossref, Google Scholar
• Browne S., Yechiali U. Dynamic priority rules for cyclic type queues. Adv. Appl. Probab. (1989) 21:432–450Crossref, Google Scholar
• Buzacott J. A., Shanthikumar J. G.Stochastic Models of Manufacturing Systems (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Cooper R. B., Niu S., Srinivasan M. M. Setups in polling models: Does it make sense to set up if no work is waiting? J. Appl. Probab. (1997) . To appear inGoogle Scholar
• Duenyas I., Van Oyen M. Heuristic scheduling of parallel heterogeneous queues with set-ups. Management Sci. (1996) 42:814–829Link, Google Scholar
• Fuhrmann S. W., Cooper R. B. Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. (1985) 33:1117–1129Link, Google Scholar
• Hofri M., Ross K. W. On the optimal control of two queues with server set-up times and its analysis. SIAM J. Comput. (1987) 16:399–420Crossref, Google Scholar
• Kekre S., Srinivasan K. Broader product line: A necessity to achieve success? Management Sci. (1990) 36:1216–1231Link, Google Scholar
• Law A. M., Kelton W. D.Simulation Modeling & Analysis (1991) (McGraw-Hill, New York) Google Scholar
• Lennon T. M. Response-time approximations for multi-server polling models, with manufacturing applications. (1994) . Ph.D. thesis, Stanford University, Stanford, CAGoogle Scholar
• Liu Z., Nain P., Towsley D. On optimal polling policies. Queueing Systems Theory Appl. (1992) 11:59–84Crossref, Google Scholar
• Mũnoz D. Cancellation methods in the analysis of simulation output. (1991) . Ph.D. thesis, Stanford University, Stanford, CAGoogle Scholar
• Markowitz D. M. A unified treatment of the single machine scheduling problem in a dynamic stochastic environment. (1996) . Ph.D. thesis, M.I.T., Cambridge, MAGoogle Scholar
• Nahmias S.Production and Operations Analysis (1993) 2nd ed.(Irwin, Homewood, IL) Google Scholar
• Olsen T. L. Asymptotics for polling models with increasing setups. (1996) . Under submissionGoogle Scholar
• Pinedo M.Scheduling Theory, Algorithms, and Systems (1995) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Reiman M. I., Wein L. M. Dynamic scheduling of a two-class queue with setups. Oper. Res. (1998) 4:532–547Link, Google Scholar
• Takagi H.Analysis of Polling Systems (1986) (MIT Press, Cambridge, MA) Google Scholar
• Takagi H.Stochastic Analysis of Computer and Communication Systems (1990) (Elsevier Science Publishers B.V., North-Holland, Amsterdam) . Chapter 1Google Scholar
• Van Mieghem J. A. Dynamic scheduling with convex delay costs: The generalized c-mu rule. Ann. Appl. Probab. (1995) 5:808–833Crossref, Google Scholar
• Webster S., Baker K. R. Scheduling groups of jobs on a single machine. Oper. Res. (1995) 43:692–703Link, Google Scholar
• Wolff R. W.Stochastic Modeling and the Theory of Queues (1989) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar