Skip to main content
  • 1128 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Askin, R.G., and Standridge,C.R. (1993). Modeling and Analysis of Manufacturing Systems. John Wiley & Sons, New York.

    MATH  Google Scholar 

  2. Buzacott, J.A., and Shanthikumar, G.J. (1993). Stochastic Models of Manufacturing Systems. Prentice Hall, Englewood Cliffs, N. Y.

    MATH  Google Scholar 

  3. Curry, G.L., Deuermeyer, B.L., and Feldman, R.M. (1989). Discrete Simulation: Fundamentals and Microcomputer Support. Holden-Day, Inc., Oakland, CA.

    Google Scholar 

  4. Diagle, J.N. (1992). Queueing Theory for Telecommunications. Addison-Wesley Publishing Co., Reading, Mass.

    Google Scholar 

  5. Duenyas, I. (1994). A Simple Release Policy for Networks of Queues with Controllable Inputs, Operations Research, 42:1162–1171.

    Article  MATH  Google Scholar 

  6. Gross, D., and Harris, C.M. (1998). Fundamentals of Queueing Theory, Third Edition, John Wiley & Sons, New York.

    Google Scholar 

  7. Harrison, J.M., and Wein, L.M. (1990). Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network, Operations Research, 38:1052–1064.

    Article  MATH  MathSciNet  Google Scholar 

  8. Hopp, W.J., and Spearman M.L. (1996). Factory Physics: Foundations of Manufacturing Management. Irwin, Chicago.

    Google Scholar 

  9. Marie, R.A. (1979). An Approximate Analytical Method for General Queueing Networks. IEEE Transactions on Software Engineering, 5:530–538.

    Article  MathSciNet  Google Scholar 

  10. Marie, R.A. (1980). Calculating Equilibrium Probabilities for ⎣ (n)/Ck/1/N Queues. Performance Evaluation Review, 9:117–125.

    Article  Google Scholar 

  11. Reiser, M., and Lavenberg, S.S. (1980). Mean-Value Analysis of Closed Multichain Queuing Networks. J. Association for ComputingMachinery, 27:313–322.

    MATH  MathSciNet  Google Scholar 

  12. Spearman, M.L., Woodruff, D.L., and Hopp, W.J. (1990). CONWIP: A Pull Alternative to Kanban, International Journal of Production Research, 28:879–894.

    Article  Google Scholar 

  13. Wein, L.M. (1990). Scheduling Networks ofQueues: Heavy Traffic Analysis of a Two-Station Closed Network with Controllable Inputs, Operations Research, 38:1065–1078.

    Article  MATH  MathSciNet  Google Scholar 

  14. Wein, L.M. (1992). Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Network with Controllable Inputs, Operations Research, 40:S312–S344.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Curry, G.L., Feldman, R.M. (2009). WIP Limiting Control Strategies. In: Manufacturing Systems Modeling and Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88763-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88763-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88762-1

  • Online ISBN: 978-3-540-88763-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics