Compensating for Failures with Flexible Servers

Published Online:https://doi.org/10.1287/opre.1070.0437

References

  • Ahn H.-S., Duenyas I., Lewis M. E. The optimal control of a two-stage tandem queueing system with flexible servers. Probab. Engrg. Inform. Sci. (2002) 16:453–469CrossrefGoogle Scholar
  • Ahn H.-S., Duenyas I., Zhang R. Optimal stochastic scheduling of a two-stage tandem queue with parallel servers. Adv. Appl. Probab. (1999) 31:1095–1117CrossrefGoogle Scholar
  • Ahn H.-S., Duenyas I., Zhang R. Optimal control of a flexible server. Adv. Appl. Probab. (2004) 36:139–170CrossrefGoogle Scholar
  • Akella R., Kumar P. R. Optimal control of production rate in a failure prone manufacturing system. IEEE Trans. Automatic Control (1986) 31:116–126CrossrefGoogle Scholar
  • Andradóttir S., Ayhan H. Throughput maximization for tandem lines with two stations and flexible servers. Oper. Res. (2005) 53:516–531LinkGoogle Scholar
  • Andradóttir S., Ayhan H., Down D. G. Server assignment policies for maximizing the steady-state throughput of finite queueing systems. Management Sci. (2001) 47:1421–1439LinkGoogle Scholar
  • Andradóttir S., Ayhan H., Down D. G. Dynamic server allocation for queueing networks with flexible servers. Oper. Res. (2003) 51:952–968LinkGoogle Scholar
  • Bambos N., Michailidis G. Queueing and scheduling in random environments. Adv. Appl. Probab. (2004) 36:293–317CrossrefGoogle Scholar
  • Bartholdi J. J., Eisenstein D. D. A production line that balances itself. Oper. Res. (1996) 44:21–34LinkGoogle Scholar
  • Bartholdi J. J., Eisenstein D. D., Foley R. D. Performance of bucket brigades when work is stochastic. Oper. Res. (2001) 49:710–719LinkGoogle Scholar
  • Bell S. L., Williams R. J. Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: Asymptotic optimality of a continuous review threshold policy. Ann. Appl. Probab. (2001) 11:608–649CrossrefGoogle Scholar
  • Bell S. L., Williams R. J. Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy. Electronic J. Probab. (2005) 10:1044–1115CrossrefGoogle Scholar
  • Bischak D. P. Performance of a manufacturing module with moving workers. IIE Trans. (1996) 28:723–733CrossrefGoogle Scholar
  • Bramson M., Williams R. J. On dynamic scheduling of stochastic networks in heavy traffic and some new results for the workload process. Proc. 39th IEEE Conf. Decision and Control (2000) Sydney, Australia:516–521CrossrefGoogle Scholar
  • Buzacott J. A., Shanthikumar J. G.Stochastic Models of Manufacturing Systems (1992) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Dai J. G. On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. (1995) 5:49–77CrossrefGoogle Scholar
  • Dai J. G.Stability of Fluid and Stochastic Processing Networks (1999) . Publication 9, Centre for Mathematical Physics and Stochastics http://www.maphysto.dk/Google Scholar
  • Dai J. G., Lin W. Maximum pressure policies in stochastic processing networks. Oper. Res. (2005) 53:197–218LinkGoogle Scholar
  • Dai J. G., Meyn S. P. Stability and convergence of moments for multiclass queueing networks via fluid models. IEEE Trans. Automatic Control (1995) 40:1889–1904CrossrefGoogle Scholar
  • Dallery Y., Gershwin S. B. Manufacturing flow line systems: A review of models and analytical results. Queueing Systems (1992) 12:13–94CrossrefGoogle Scholar
  • Davis M. H. A. Piecewise deterministic Markov processes: A general class of diffusion stochastic models. J. Roy. Statist. Soc. Series B (1984) 46:353–388Google Scholar
  • Gurumurthi S., Benjaafar S. Modeling and analysis of flexible queueing systems. Naval Res. Logist. (2004) 51:755–782CrossrefGoogle Scholar
  • Harrison J. M. Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. (2000) 10:75–103CrossrefGoogle Scholar
  • Harrison J. M., López M. J. Heavy traffic resource pooling in parallel-server systems. Queueing Systems (1999) 33:339–368CrossrefGoogle 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–771CrossrefGoogle Scholar
  • Hopp W. J., van Oyen M. P. Agile workforce evaluation: A framework for cross-training and coordination. IIE Trans. (2004) 36:919–940CrossrefGoogle Scholar
  • Hopp W. J., Tekin E., van Oyen M. P. Benefits of skill chaining in serial production lines with cross-trained workers. Management Sci. (2004) 50:83–98LinkGoogle Scholar
  • Jordan W. J., Graves S. C. Principles on the benefits of manufacturing process flexibility. Management Sci. (1995) 41:577–594LinkGoogle Scholar
  • Lawler E. L.Combinatorial Optimization: Networks and Matroids (1976) (Holt, Rinehart, and Winston, New York) Google Scholar
  • Laws C. N. Resource pooling in queueing networks with dynamic routing. Adv. Appl. Probab. (1992) 24:699–726CrossrefGoogle Scholar
  • Mandelbaum A., Stolyar A. L. Scheduling flexible servers with convex delay costs: Heavy traffic optimality of the generalized cμ rule. Oper. Res. (2004) 52:836–855LinkGoogle Scholar
  • Meyn S. P., Down D. Stability of generalized Jackson networks. Ann. Appl. Probab. (1994) 9:124–148CrossrefGoogle Scholar
  • Ostalaza J., McClain J., Thomas J. The use of dynamic (state-dependent) assembly-line balancing to improve throughput. J. Manufacturing Oper. Management (1990) 3:105–133Google Scholar
  • Perkins J. R., Srikant R. Scheduling multiple part-types in an unreliable single machine manufacturing system. IEEE Trans. Automatic Control (1997) 42:364–377CrossrefGoogle Scholar
  • Rybko A. N., Stolyar A. L. Ergodicity of stochastic processes describing the operation of open queueing networks. Problems of Inform. Transmission (1992) 28:199–220Google Scholar
  • Sheikhzadeh M., Benjaafar S., Gupta D. Machine sharing in manufacturing systems: Flexibility versus chaining. Internat. J. Flexible Manufacturing Systems (1998) 10:351–378CrossrefGoogle Scholar
  • Sigman K. The stability of open queueing networks. Stochastic Processes and Their Appl. (1990) 35:11–25CrossrefGoogle Scholar
  • Squillante M. S., Xia C. H., Yao D. D., Zhang L. Threshold-based priority policies for parallel-server systems with affinity scheduling. Proc. 2001 Amer. Control Conf. (2001) Arlington, VA:2992–2999CrossrefGoogle Scholar
  • Tassiulas L., Bhattacharya P. B. Allocation of independent resources for maximal throughput. Stochastic Models (2000) 16:27–48CrossrefGoogle Scholar
  • Tassiulas L., Ephrimedes A. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automatic Control (1992) 37:1936–1948CrossrefGoogle Scholar
  • Wu C.-H., Lewis M. E., Veatch M. Dynamic allocation of reconfigurable resources in a two-stage tandem queueing system with reliability considerations. IEEE Trans. Automatic Control (2006) 51:309–314CrossrefGoogle Scholar
  • Zavadlav E., McClain J. O., Thomas L. J. Self-buffering, self-balancing, self-flushing production lines. Management Sci. (1996) 42:1151–1164LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.