Effective Sequencing Rules for Closed Manufacturing Networks

References

• Chevalier P. B., Wein L. M. Scheduling networks of queues: heavy traffic analysis of a multistation closed network. Oper. Res. (1993) 42:476–491Google Scholar
• Duenyas I. A simple release policy for networks of queues with controllable inputs. Oper. Res. (1994) 42:1162–1171Link, Google Scholar
• Goldratt E. M., Fox R. E.The Race (1986) (North River Press Inc., Croton-on-Hudson, New York) Google Scholar
• Gilland W. G. Analysis of optimal and nearly-optimal sequencing policies for a closed queueing network. (2000) . Working Paper. University of North CarolinaGoogle Scholar
• Harrison J. M. Brownian models of queueing networks with heterogeneous customer populations. Stochastic Differential Systems Stochastic Control Theory and Applications (1988) (Springer-Verlag, New York)147–186Crossref, Google Scholar
• Harrison J. M., Wein L. M. Scheduling networks of queues: heavy traffic analysis of a two-station closed network. Oper. Res. (1990) 38:1052–1064Link, Google Scholar
• Harrison J. M., Nguyen V. Some badly behaved closed queueing networks. Stochastic Networks (1995) (Springer-Verlag New York)117–124Crossref, Google Scholar
• Harrison J. M., Van Mieghem J. A. Dynamic control of Brownian networks: state space collapse and equivalent workload formulations. Ann. Appl. Probab. (1997) 7:747–771Crossref, Google Scholar
• Little J. D. C. A proof of the queueing formula L = λW. Oper. Res. (1961) 9:383–387Link, Google Scholar
• Solberg J. J. Capacity planning with a stochastic workflow model. AIIE Trans. (1981) 13:116–122Crossref, Google Scholar
• Spearman M. L., Woodruff D. L., Hopp W. J. CONWIP: a pull alternative to Kanban Internat. J. Production Res. (1990) 28:879–894Crossref, Google Scholar