Manufacturing systems modeling and analysis

Manufacturing Systems Modeling and Analysis

Volumn , Issue , 2009, Pages 1-327

  Curry, Guy L ^a   Feldman, Richard M ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892297871     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-88763-8     Document Type: Book

References (71)

1. Abramowitz, M., and Stegun, I. A., editors (1970). Handbook of Mathematical Functions, Dover Publications, Inc., New York.
2. Barlow, R. E., and Proschan, F. (1975). Statistical Theory of Reliability and Life Testing, Holt, Rinehart and Winston, Inc., New York.
3. Feldman, R. M., and Valdez-Flores, C. (1996). Applied Probability & Stochastic Processes, PWS Publishing Company, Boston.
4. Çinlar, E. (1975). Introduction to Stochastic Processes, Prentice-Hall, Inc., Englewood Cliffs, NJ.
5. Hastings, Jr., C. (1955). Approximations for Digital Computers, Princeton University Press, Princeton, NJ.
6. Law, M., and Kelton, W. D. (1991). Simulation Modeling and Analysis, 2nd edition, McGraw-Hill Book Company, New York.
7. Rahman, N. A. (1968). A Course in Theoretical Statistics, Hafner Publishing Co., New York.
8. Deuermeyer, B. L., Curry, G. L., and Feldman, R. M. (1993). An Automatic Modeling Approach for the Strategic Analysis of Manufacturing Facilities. Production and Operations Management, 2:195-220.
9. Gross, D., and Harris, C. M. (1974). Fundamentals of Queueing Theory, John Wiley & Sons, New York.
10. Hopp, W. J., and Spearman, M. L. (1996). Factory Physics: Foundationsof Manufacturing Management, Irwin, Chicago.
11. Little, J. D. C. (1961). A Proof for the Queuing Formula: L =λW. Operations Research, 9:383-387.
12. Allen, A. O. (1978). Probability, Statistics, and Queueing Theory: With Computer Science Applications, Academic Press, New York.
13. Altiok, T. (1996). Performance Analysis of Manufacturing Systems, Springer-Verlag, New Yo r k.
14. Hall, R. W. (1991). Queueing Methods: For Services and Manufacturing, Prentice-Hall, Englewood Cliffs, N. J.
15. Gross, D., and Harris, C. M. (1998). Fundamentals of Queueing Theory, Third Edition, John Wiley & Sons, New York.
16. Hopp, W. J. and Spearman M. L. (1996). Factory Physics:Foundationsof ManufacturingManagement, Irwin, Chicago.
17. Kendall, D. G. (1953). Stochastic Processes Occurring in the Theory of Queues and Their Analysis by the Method of Imbedded Markov Chains. Annals of Mathematical Statistics, 24:338-354.
18. Kingman, J. F. C. (1962). On queues in heavy traffic. J. Royal Statist. Soc. Ser. B, 32:102-110.
19. Kraemer, W. and Langenbach-Belz, M. (1976). Approximate Formulae for the Delay in the Queueing System GI/G/1. Congressbook, Eighth Int. Teletraffic Cong., Melbourne.
20. ρ (1-ρ). Annuals of the Institute of Statistical Mathematics, 29:67-75.
21. Whitt, W. (1983). The Queueing Network Analyzer. The Bell System Technical Journal, 62:2779-2814.
22. Feldman, R. M., Deuermeyer, B. L., and Valdez-Flores, C. (1993). Utilization of the Method of Linear Matrix Equationsto Solve a Quasi-Birth-DeathProblem, J. Applied Probability, 30:639-649.
23. Hopp, W. J., and Spearman M. L. (2000). Factory Physics: Foundations of Manufacturing Management, second edn. IRWIN, Chicago
24. Albin, S. L. (1984). Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues. Operations Research, 30:1133-1162.
25. Burke, P. J. (1968). The Output Process of a Stationary M/M/s Queueing System. Annuals Math. Stat., 39:1144-1152.
26. Buzacott, J. A., and Shanthikumar, J. G. (1963). Stochastic Models of Manufacturing Systems. Prentice Hall, Englewood Cliffs, NJ.
27. Marshall, K. T. (1968). Some Inequalities in Queueing, Operations Research, 16:651-665.
28. Whitt, W. (1982). Approximating a PointProcessby a RenewalProcess, I: Two BasicMethods. Operations Research, 30:125-147.
29. Whitt, W. (1983). The Queueing Network Analyzer, The Bell System Technical Journal, 62:2779-2814.
30. Askin, R. G. and Standridge, C. R. (1993). Modeling and Analysis of Manufacturing Systems. John Wiley & Sons, New York.
31. Bitran, G. R., and Tirupati, D. (1988). Multiproduct Queueing Networks with Deterministic Routings: Decomposition Approach and the Notion of Interference. Management Science, 34:75-100.
32. Caldentey, R. (2001). Approximations for Multi-Class Departure Processes. Queueing Systems, 38:205-212.
33. Deuermeyer, B. L., Curry, G. L., and Feldman, R. M. (1993). An Automatic Modeling Approach to the Strategic Analysis of Semiconductor Fabrication Facilities. Production and Operations Management, 2:195-220.
34. Groover, M. P. (2001). Automation, Production Systems, and Computer-Integrated Manufacturing (Second Ed.) Prentice-Hall, Upper Saddle River, NJ.
35. Whitt, W. (1994). Towards Better Multi-class Parametric-Decomposition Approximations for Open Queueing Networks. Ann. Oper. Res., 48:221-248.
36. Albin, S. L, and Kai, S. (1986). Approximation for the Departure Process of a Queue in a Network. Naval Research Logistics Quarterly, 33:129-143.
37. Cooper, R. B. (1990). Introduction to Queueing Theory, Third Edition. The MacMillan Company, New York.
38. Curry, G. L., and Deuermeyer B. L. (2002). Renewal approximations of the departure processes of batch systems. IIE Transactions, 34:95-104.
39. Curry, G. L., and Feldman, R. M. (1985). An M/M/1 Queue with a General Bulk Service Rule. Naval Research Logistics Quarterly, 32:595-603.
40. Hopp, W. J., and Spearman, M. L. (1996). Factory Physics: Foundations of Manufacturing Management. Irwin, Chicago.
41. Buzacott, J. A., and Shanthikumar, G. J. (1993). Stochastic Models of Manufacturing Systems. Prentice-Hall, Englewood Cliffs, New Jersey.
42. Askin, R. G., and Standridge, C. R. (1993). Modeling and Analysis of Manufacturing Systems. John Wiley & Sons, New York.
43. Buzacott, J. A., and Shanthikumar, G. J. (1993). Stochastic Models of Manufacturing Systems. Prentice Hall, Englewood Cliffs, N. Y.
44. Curry, G. L., Deuermeyer, B. L., and Feldman, R. M. (1989). Discrete Simulation: Fundamentals and Microcomputer Support. Holden-Day, Inc., Oakland, CA.
45. Diagle, J. N. (1992). Queueing Theory for Telecommunications. Addison-Wesley Publishing Co., Reading, Mass.
46. Duenyas, I. (1994). A Simple Release Policy for Networks of Queues with Controllable Inputs, Operations Research, 42:1162-1171.
47. Gross, D., and Harris, C. M. (1998). Fundamentals of Queueing Theory, Third Edition, John Wiley & Sons, New York.
48. Harrison, J. M., and Wein, L. M. (1990). SchedulingNetworks of Queues: Heavy TrafficAnalysis of a Two-Station Closed Network, Operations Research, 38:1052-1064.
49. Hopp, W. J., and Spearman M. L. (1996). Factory Physics: Foundations of Manufacturing Management. Irwin, Chicago.
50. Marie, R. A. (1979). An Approximate Analytical Method for General Queueing Networks. IEEE Transactions on Software Engineering, 5:530-538.
51. k/1/N Queues. Performance Evaluation Review, 9:117-125.
52. Reiser, M., and Lavenberg, S. S. (1980). Mean-Value Analysis of Closed Multichain Queuing Networks. J. Association for Computing Machinery, 27:313-322.
53. 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.
54. Wein, L. M. (1990). SchedulingNetworks of Queues: Heavy TrafficAnalysis of a Two-Station Closed Network with Controllable Inputs, Operations Research, 38:1065-1078.
55. Wein, L. M. (1992). SchedulingNetworks of Queues: Heavy Traffic Analysis of a Multistation Network with Controllable Inputs, Operations Research, 40:S312-S344.
56. Altiok, T. (1996). Performance Analysis of Manufacturing Systems. Springer-Verlag, N. Y.
57. Altiok, T., and Stidham, Jr., S. (1983). The Allocation of Interstage Buffer Capacities in Production Lines. IIE Transactions, 15:292-299.
58. Arrts, E., and Lenstra, J. K., editors (1997). Local Search in CombinatorialOptimization. John Wiley & Sons.
59. Dallery, Y., and Frein, Y. (1993). On Decomposition Methods for Tandem Queueing Networks with Blocking. Operations Research, 41:386-399.
60. Deuermeyer, B. L., Curry, G. L., Duchowski, A. D., and Venkatesh, S. (1997). An Automatic Approach to Deadlock Detection and Resolution in Discrete Simulation Systems. INFORMS Journal on Computing, 9:195-205.
61. Glover, F., and Luguna, M. (1997). Ta bu Search, Kluwer Academic Publishers.
62. Hillier, F. S., and So, K. C. (1991). The Effect of the Coefficient of Variation of Operation Times on the Allocation of Storage Space in Production Line Systems. IIE Transactions, 23:198-206.
63. Hillier, F. S., and So, K. C. (1995). On the Optimal Design of Tandem Queueing Systems with Finite Buffers. Queueing Systems, 21:245-266.
64. Jun, K. P., and Perros, H. G. (1988). Approximate Analysis of Arbitrary Configurations of Queueing Networks with Blocking and Deadlock. Queueing Networks with Blocking: Proceedings of the First International Conference Workshop, Raleigh, NC, pp. 259-279.
65. Lee, H. S., and Pollock, S. M. (1990). Approximation Analysis of Open Acyclic Exponential Queueing Networks With Blocking. Operations Research, 38:1123-1134.
66. Neuts, M. F. (1981). Matrix-Geometric Solution in Stochastic Models, Johns Hopkins University Press, Baltimore.
67. Papadopoulos, H. T., Heavey, C., and Browne, J. (1993). Queueing Theory in Manufacturing Systems Analysis and Design. Chapman & Hall, London.
68. Perros, H. (1994). Queueing Networks with Blocking. Oxford University Press, N. Y.
69. Smith, J. M., and Daskalaki, S. (1988). Buffer Space Allocation in Automated Assembly Lines. Operations Research, 36:343-358.
70. Spinellis, D., Papadopoulos, C. and Smith, J. M. (2000). Large Production Line Optimization using Simulated Annealing. Int. J. Prod. Res., 38:509-541.
71. Venkatesh, S., Smith, J., Deuermeyer, B. L., and Curry, G. L. (1998). Deadlock Detection and Resolution for Discrete-Event Simulation: Multiple-Unit Seizes. IIE Transactions, 30:201-216.