Skip to main content
SpringerLink
Log in

Evaluative Models of Discrete Part Production Lines

  • Chapter
  • First Online:
Analysis and Design of Discrete Part Production Lines

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 31))

Abstract

The focus here is on discrete part production lines with asynchronous movement where each part produced is distinct. Production lines processing fluids and other continuous materials are not considered. From here on, when reference is made to production lines, discrete part production lines will be understood. In a production or flow line, all jobs are required to pass through each station in the same sequence once. These lines are usually associated with scale rather than scope, and a major advantage of production lines is the associated simple materials handling requirements.

A production line consists of work-stations, materials, human resources, and inter-work-station storage facilities. Storage facilities have a finite capacity. Randomness is introduced due to random processing times and the random behavior of work-stations in relation to failure and repair. In terms of classical queueing theory, production lines would be described as finite buffer tandem queueing systems where the work-stations are the servers, storage facilities are the buffers or the waiting lines, and the jobs are the customers.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alkaff, A. and Muth, E.J. (1987), The throughput rate of multistation production lines with stochastic servers, Probability in the Engineering and Informational Sciences, Vol. 1, pp. 309–326.

    Article  MATH  Google Scholar 

  2. Altiok, T. (1982), Approximate analysis of exponential tandem queues with blocking, European Journal of Operational Research, Vol. 11, pp. 390–398.

    Article  MATH  Google Scholar 

  3. Altiok, T. (1989), Approximate analysis of queues in series with phase-type service times and blocking, Operations Research, Vol. 37, pp. 601–610.

    Article  MATH  MathSciNet  Google Scholar 

  4. Altiok, T. (1997), Performance Analysis of Manufacturing Systems, Springer.

    Google Scholar 

  5. Altiok, T. and Ranjan, R. (1989), Analysis of production lines with general service times and finite buffers: A two-node decomposition approach, Engineering Costs and Production Economics, Vol. 17, pp. 155–165.

    Article  Google Scholar 

  6. Altiok, T. and Melamed, B. (2001), Simulation Modeling and Analysis with Arena, Cyber Research, Inc. and Enterprise Technology Solutions, Inc.

    Google Scholar 

  7. Ammar, M. and Gershwin, S.B. (1989), Equivalence relations in queueing models of fork/join queueing networks with blocking, Performance Evaluation, Vol. 10, pp. 233–245.

    Article  MathSciNet  Google Scholar 

  8. Ancelin, B. and Semery, A. (1987), Calcul de la productivite d’une ligne integree de fabrication: CALIF, une methode analytique industrielle, RAIRO, APII, Vol. 21, No. 3, pp. 209–238.

    Google Scholar 

  9. Anderson, D.R. and Moodie, C.L. (1969), Optimal buffer storage capacity in production line systems, International Journal of Production Research, Vol. 7, pp. 233–240.

    Article  Google Scholar 

  10. Banks, J., Carson, J.S., and Nelson, B.L. (1999), Discrete-Event System Simulation, 2nd Edition, Prentice Hall.

    Google Scholar 

  11. Benson, D. (1996), Simulation Modeling and Optimization using PROMODEL, PROMODEL Corporation, Orem, Utah.

    Google Scholar 

  12. Blumenfeld, D.E. (1990), A simple formula for estimating throughput of serial production lines with variable processing times and limited buffer capacity, International Journal of Production Research, Vol. 28, No. 6, pp. 1163–1182.

    Google Scholar 

  13. Boxma, O.J. and Konheim, A.G. (1981), Approximate analysis of exponential queueing systems with blocking, Acta Informatica, Vol. 15, pp. 19–66.

    Article  MATH  MathSciNet  Google Scholar 

  14. Brandwajn, A. and Jow, Y.L. (1988), An approximation method for tandem queues with blocking, Operations Research, Vol. 36, pp. 73–83.

    Article  MATH  MathSciNet  Google Scholar 

  15. Brateley, P., Fox, B.L., and Schrage, L.E. (1987), A Guide to Simulation, Springer-Verlag.

    Google Scholar 

  16. Burman, M.H. (1995), New Results in Flow Line Analysis, Ph.D. Thesis, Massachusetts Institute of Technology (M.I.T.).

    Google Scholar 

  17. Buzacott, J.A. (1972), The effect of station breakdowns and random processing times on the capacity of flow lines with in-process storage, AIIE Transactions, Vol. 4, No. 4, pp. 308–313.

    Google Scholar 

  18. Buzacott, J.A. and Kostelski, D. (1987), Matrix-geometric and recursive algorithm solution of a two-stage unreliable flow line, IIE Transactions, Vol. 19, pp. 429–438.

    Article  Google Scholar 

  19. Buzacott, J.A. and Shanthikumar, J.G. (1993), Stochastic Models of Manufacturing Systems, Prentice Hall.

    Google Scholar 

  20. Caseau, P. and Pujolle, G. (1979), Throughput capacity of a sequence of transfer lines with blocking due to finite waiting room, IEEE Transactions Software Eng., SE-5, pp. 631–642.

    Google Scholar 

  21. Cheah, J.Y. and MacGregor Smith, J. (1994), Generalized M ∕ G ∕ C ∕ C state dependent queueing models and pedestrial traffic flows, Queueing Systems, Vol. 15, pp. 365–386.

    Article  MATH  Google Scholar 

  22. Colledani, M., Matta, A., and Tolio, T. (2003), Performance evaluation of production lines with finite buffer capacity producing two different products, In Proceedings of the Fourth Aegean International Conference on Analysis of Manufacturing Systems, pp. 231–240, Samos Island, Greece.

    Google Scholar 

  23. Dallery, Y., David, R., and Xie, X.L. (1988), An efficient algorithm for analysis of transfer lines with unreliable machines and finite buffers, IIE Transactions, Vol. 20, pp. 280–283.

    Article  Google Scholar 

  24. Dallery, Y. and Frein, Y. (1993), On decomposition methods for tandem queueing networks with blocking, Operations Research, Vol. 41, No. 2, pp. 386–399.

    MATH  MathSciNet  Google Scholar 

  25. Dallery, Y. and Gershwin, S.B. (1992), Manufacturing flow line systems: A review of models and analytical results, Queueing Systems Theory and Applications, Vol. 12, pp. 3–94.

    Article  MATH  Google Scholar 

  26. Dallery, Y., Liu, Z., and Towsley, D. (1994), Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking, Journal of the Association for Computing Machinery, Vol. 41, No. 5, pp. 903–942.

    MathSciNet  Google Scholar 

  27. Diamantidis, A.C., Papadopoulos, C.T., and Heavey, C. (2006), Approximate analysis of serial flow lines with multiple parallel-machine stations, IIE Transactions, Vol. 39, No. 4, pp. 361–375.

    Google Scholar 

  28. Diamantidis, A.C., Papadopoulos, C.T., and Vidalis, M.I. (2004), Exact analysis of a discrete material three station one buffer merge system with unreliable machines, International Journal of Production Research, Vol. 42, No. 4, pp. 651–675.

    Google Scholar 

  29. Di Mascolo, M., David, R., and Dallery, Y. (1991), Modeling and analysis of assembly systems with unreliable machines and finite buffers, IIE Transactions, Vol. 23, No. 4, pp. 315–330.

    Google Scholar 

  30. Dubois, D. and Forestier, J.P. (1982), Productivité et en-cours moyens d’un ensemble de deux machines separées par une zone de stockage, RAIRO Automatique, Vol. 16, No. 2, pp. 105–132.

    MATH  Google Scholar 

  31. Fishman, G.S. (1973), Concepts and Methods in Discrete Event Simulation, Wiley.

    Google Scholar 

  32. Forestier, J.P. (1980), Modelisation stochastique et comportement asymptotique d’un systéme automatise de production, RAIRO Automatique, Vol. 14, No. 2, pp. 127–143.

    MATH  MathSciNet  Google Scholar 

  33. Freeman, D.R. (1968), A general line balancing model, Proceedings of the 19th Annual Conference, AIIE, Tampa, Florida, Norcross, Georgia: American Institute of Industrial Engineers, pp. 230–235.

    Google Scholar 

  34. Frein, Y., Commault, C., and Dallery, Y. (1996), Modeling and analysis of closed-loop production lines with unreliable machines and finite buffers, IIE Transactions, Vol. 28, pp. 545–554.

    Google Scholar 

  35. Friedman, H.D. (1965), Reduction methods for tandem queueing systems, Operations Research, Vol. 13, pp. 121–131.

    Article  MATH  MathSciNet  Google Scholar 

  36. Gershwin, S.B. (1987), An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking, Operations Research, Vol. 35, pp. 291–305.

    Article  MATH  MathSciNet  Google Scholar 

  37. Gershwin, S.B. (1991), Assembly/disassembly systems: An efficient decomposition algorithm for tree structured networks, IIE Transactions, Vol. 23, No. 4, pp. 302–314.

    Google Scholar 

  38. Gershwin, S.B. (1994), Manufacturing Systems Engineering, Prentice Hall.

    Google Scholar 

  39. Gershwin, S.B. and Berman, O. (1981), Analysis of transfer lines consisting of two unreliable machines with random processing times and finite storage buffers, AIIE Transactions, Vol. 13, No. 1, pp. 2–11.

    Google Scholar 

  40. Gershwin, S.B., Maggio, N., Matta, A., Tolio, T., and Werner, L. (2001), Analysis of loop networks by decomposition, In Proceedings of the Third Aegean International Conference on Analysis and Modeling of Manufacturing Systems, pp. 239–248, Tinos Island, Greece.

    Google Scholar 

  41. Gershwin, S.B. and Schick, I.C. (1983), Modeling and analysis of three-stage transfer lines with unreliable machines and finite buffers, Operations Research, Vol. 31, No. 2, pp. 354–380.

    MATH  Google Scholar 

  42. Gosavi, H.D. and MacGregor Smith, J. (1995), Asymptotic bounds of throughput in series-parallel queueing networks, Computers & Operations Research, Vol. 22, No. 10, pp. 1057–1073.

    MATH  Google Scholar 

  43. Gun, L. and Makowski, A. (1989), An approximation method for general tandem queueing systems subject to blocking, Proc. 1st Int’l Workshop on Queueing Networks with Blocking, Raleigh, NC.

    Google Scholar 

  44. Haydon, B.J. (1973), The behaviour of systems of finite queues, Ph.D. Thesis, The University of New South Wales, Kensington, New South Wales, Australia.

    Google Scholar 

  45. Heavey, C., Papadopoulos, H.T., and Browne, J. (1993), The throughput rate of multistation unreliable production lines, European Journal of Operational Research, Vol. 68, pp. 69–89.

    Article  MATH  Google Scholar 

  46. Helber, S. (1998), Decomposition of unreliable assembly/disassembly networks with limited buffer capacity and random processing times, European Journal of Operational Research, Vol. 109, No. 1, pp. 24–42.

    MATH  Google Scholar 

  47. Helber, S. (1999), Performance Analysis of Flow Lines with Non-Linear Flow of Material, In Volume 473 of Lecture Notes in Economics and Mathematical Systems, Springer-Verlag.

    Google Scholar 

  48. Helber, S. and Jusic, H. (2004), A new decomposition approach for non-cyclic continuous material flow lines with a merging flow of material, Annals of Operations Research, Vol. 124, No. 1–4, pp. 117–139.

    MathSciNet  Google Scholar 

  49. Helber, S. and Mehrtens, N. (2003), Exact analysis of a continuous material merge system with limited buffer capacity and three stations, In S.B. Gershwin, Y. Dallery, C.T. Papadopoulos, and J. MacGregor Smith, Editors, Analysis and Modeling of Manufacturing Systems, pp. 85–121, Kluwer Academic Publishers.

    Google Scholar 

  50. Hillier, F.S. and Boling, R.W. (1967), Finite queues in series with exponential or Erlang service times – A numerical approach, Operations Research, Vol. 15, pp. 286–303.

    Article  MATH  Google Scholar 

  51. Hillier, F.S. and So, K.C. (1989), The assignment of extra servers to stations in tandem queueing systems with small or no buffer, Performance Evaluation, Vol. 10, pp. 219–231.

    Article  Google Scholar 

  52. Hillier, F.S. and So, K.C. (1995), On the optimal design of tandem queueing systems with finite buffers, Queueing Systems, Vol. 21, pp. 245–266.

    Article  MATH  MathSciNet  Google Scholar 

  53. Hillier, F.S. and So, K.C. (1996), On the simultaneous optimization of server and work allocations in production line systems with variable processing times, Operations Research, Vol. 44, No. 3, pp. 435–443.

    MATH  Google Scholar 

  54. Hunt, G.C. (1956), Sequential arrays of waiting lines, Operations Research, Vol. 4, pp. 674–683.

    Article  Google Scholar 

  55. Iyama, T. and Ito, S. (1987), The maximum production rate for an unbalanced multi-server flow line system with finite buffer storage, International Journal of Production Research, Vol. 25, No. 8, pp. 1157–1170.

    MATH  Google Scholar 

  56. Jain, S. and Smith, J.M. (1994), Open finite queueing networks with M ∕ M ∕ C ∕ K parallel servers, Computers & Operations Research, Vol. 21, No. 3, pp. 297–317.

    MATH  Google Scholar 

  57. Jeong, K.-C. and Kim, Y.-D. (1998), Performance analysis of assembly/disassembly systems with unreliable machines and random processing times, IIE Transactions, Vol. 30, pp. 41–53.

    Article  Google Scholar 

  58. Jeong, K.-C. and Kim, Y.-D. (1999), An approximation method for performance analysis of assembly/disassembly systems with parallel-machine stations, IIE Transactions, Vol. 31, pp. 391–394.

    Google Scholar 

  59. Jun, K. and Perros, H.G. (1987), An approximate analysis of open tandem queueing networks with blocking and general service times, Computer Science, NCSU, Raleigh, NC.

    Google Scholar 

  60. Kelton, W.D., Sadowski, R.P., and Sadowski, D.A. (1998), Simulation with Arena, McGraw-Hill.

    Google Scholar 

  61. Kerbache, L. (1984), Analysis of open finite queueing networks, Ph.D. thesis, Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, MA.

    Google Scholar 

  62. Kerbache, L. and MacGregor Smith, J. (1987), The generalized expansion method for open finite queueing networks, European Journal of Operational Research, Vol. 32, pp. 448–461.

    Article  MATH  MathSciNet  Google Scholar 

  63. Khoshnevis, B. (1994), Discrete Systems Simulation, McGraw-Hill.

    Google Scholar 

  64. Kleinrock, L. (1975), Queueing Systems, Vol. I, Wiley.

    Google Scholar 

  65. Knott, A.D. (1970), The inefficiency of a series of work-stations – a simple formula, International Journal of Production Research, Vol. 8, pp. 109–119.

    Article  Google Scholar 

  66. Kouikoglou, V.S. and Phillis, Y.A. (2001), Hybrid Simulation Models of Production Networks, Kluwer Academic Publishers.

    Google Scholar 

  67. Kuhn, H. (2003), Analysis of automated flow line systems with repair crew interference, In S.B. Gershwin, Y. Dallery, C.T. Papadopoulos, and J. MacGregor Smith, Editors, Analysis and Modeling of Manufacturing Systems, pp. 155–179, Kluwer Academic Publishers.

    Google Scholar 

  68. Labetoulle, J. and Pujolle, G. (1980), Isolation method in a network of queues, IEEE Transact. Software Eng., Vol. SE-6, No. 4.

    Google Scholar 

  69. Law, A.M. and Kelton, W.D. (2000), Simulation Modeling and Analysis, McGraw-Hill.

    Google Scholar 

  70. Levantesi, R., Matta, A., and Tolio, T. (1999a), Exponential two machine lines with multiple failure modes and finite buffer capacity, In Proceedings of the Second Aegean International Conference on Analysis and Modeling of Manufacturing Systems, pp. 103–112, Tinos Island, Greece.

    Google Scholar 

  71. Levantesi, R., Matta, A., and Tolio, T. (1999b), A decomposition method for the performance evaluation of production lines with random processing times, multiple failure modes and finite buffer capacity, In Proceedings of the Second Aegean International Conference on Analysis and Modeling of Manufacturing Systems, pp. 113–122, Tinos Island, Greece.

    Google Scholar 

  72. Levantesi, R., Matta, A., and Tolio, T. (2003), Performance evaluation of continuous production lines with machines having different processing times and multiple failure modes, Performance Evaluation, Vol. 51, pp. 247–268.

    Article  Google Scholar 

  73. Lim, J.-T., Meerkov, S.M., and Top, F. (1990), Homogeneous, asymptotically reliable serial production lines: Theory and a case study, IEEE Transactions on Automatic Control, Vol. 35, No. 5, pp. 524–534.

    MATH  MathSciNet  Google Scholar 

  74. Magazine, M.J. and Stecke, K.E. (1996), Throughput for production lines with serial work-stations and parallel service facilities, Performance Evaluation, Vol. 25, No. 3, pp. 211–232.

    MATH  Google Scholar 

  75. Makino, T. (1964), On the mean passage time concerning some queueing problems of the tandem type, J. Opns Res. Soc. Japan, Vol. 7, pp. 17–47.

    MathSciNet  Google Scholar 

  76. Muth, E.J. (1984), Stochastic processes and their network representations associated with a production line queueing model, European Journal of Operational Research, Vol. 15, pp. 63–83.

    Article  MATH  MathSciNet  Google Scholar 

  77. Muth, E.J. (1987), An update on analytical models of serial transfer lines, Research Report, No. 87-15, Gainesville, FL: Department of Industrial and Systems Engineering, University of Florida.

    Google Scholar 

  78. Nemec, J.E. (1999), Diffusion and Decomposition Approximations of Stochastic Models of Multiclass Processing Networks, Ph.D. Thesis, Massachusetts Institute of Technology (M.I.T.).

    Google Scholar 

  79. Neuts, M.F. (1981), Matrix-Geometric Solutions in Stochastic Models – An Algorithmic Approach, The Johns Hopkins University Press.

    Google Scholar 

  80. Onvural, R.O. and Perros, H.G. (1986), On equivalencies of blocking mechanisms in queueing networks with blocking, Operations Research Letters, Vol. 5, No. 6, pp. 293–298.

    MATH  MathSciNet  Google Scholar 

  81. Papadopoulos, H.T. (1989), Mathematical modelling of reliable production lines, Ph.D. Thesis, University College Galway, Ireland.

    Google Scholar 

  82. Papadopoulos, H.T. (1996), An analytic formula for the mean throughput of K-station production lines with no intermediate buffers, European Journal of Operational Research, Vol. 91, pp. 481–494.

    Article  MATH  Google Scholar 

  83. Papadopoulos, H.T., Heavey, C., and Browne, J. (1993), Queueing Theory in Manufacturing Systems Analysis and Design, Chapman & Hall.

    Google Scholar 

  84. Papadopoulos, H.T., Heavey, C., and O’Kelly, M.E.J. (1989) Throughput rate of multistation reliable production lines with inter-station buffers (I) Exponential Case, Computers in Industry, Vol. 13, No. 3, pp. 229–244.

    Google Scholar 

  85. Papadopoulos, H.T., Heavey, C., and O’Kelly, M.E.J. (1990), Throughput rate of multistation reliable production lines with inter station buffers: II Erlang case, Computers in Industry, Vol. 13, No. 4, pp. 317–335.

    Google Scholar 

  86. Papadopoulos, H.T. and O’Kelly, M.E.J. (1989) A recursive algorithm for generating the transition matrices of multistation series production lines, Computers in Industry, Vol. 12, pp. 227–240.

    Article  Google Scholar 

  87. Patchong, A. and Willaeys, D. (2001), Modeling and analysis of an unreliable flow line composed of parallel-machine stages, IIE Transactions, Vol. 33, pp. 559–568.

    Google Scholar 

  88. Perros, H. (1994), Queueing Networks with Blocking - Exact and Approximate Solutions, Oxford University Press.

    Google Scholar 

  89. Perros, H.G. and Altiok, T. (1986), Approximate analysis of open networks of queues with blocking, tandem configurations, IEEE Trans. Soft. Eng., SE-12, pp. 450–461.

    Google Scholar 

  90. Pritsker, A.A.B. (1986), Introduction to Simulation and Slam II, 3rd Edition, Halsted.

    Google Scholar 

  91. Sevast’yanov, B.A. (1962) Influence of stage bin capacity on the average standstill time of a production line, Theory of Probability and its Applications, Vol. 7, No. 4, pp. 429–438.

    MATH  MathSciNet  Google Scholar 

  92. Systems Modeling Corporation (1999), Guide to Arena Standard Edition, Sewickley.

    Google Scholar 

  93. Takahashi, Y., Miyahara, H., and Hasegawa, T. (1980), An approximation method for open restricted queueing network, Operations Research, Vol. 28, pp. 594–602.

    Article  MATH  MathSciNet  Google Scholar 

  94. Tan, B. (2001), A three-station merge system with unreliable stations and a shared buffer, Mathematical and Computer Modeling, Vol. 33, pp. 1011–1026.

    Article  MATH  Google Scholar 

  95. Tempelmeier, H. and Burger, M. (2001), Performance evaluation of unbalanced flow lines with general distributed processing times, failures and imperfect production, IIE Transactions, Vol. 33, No. 4, pp. 293–302.

    Google Scholar 

  96. Tolio, T. and Matta, A. (1998), A method for performance evaluation of automated flow lines, Annals of the CIRP, Vol. 47, No. 1, pp. 373–376.

    Google Scholar 

  97. Tolio, T., Matta, A., and Gershwin, S.B. (2002), Analysis of two-machine lines with multiple failure modes, IIE Transactions, Vol. 34, pp. 51–62.

    Google Scholar 

  98. Van Dijk, N. and van der Wal, J. (1989), Simple bounds and monotonicity results for finite multi-server exponential tandem queues, Queueing Systems Theory and Applications, Vol. 4, pp. 1–16.

    Article  MATH  MathSciNet  Google Scholar 

  99. Vidalis, M.I. and Papadopoulos, H.T. (2001), A recursive algorithm for generating the transition matrices of multistation multiserver exponential queueing networks, Computers & Operations Research, Vol. 28, No. 9, pp. 853–883.

    MATH  Google Scholar 

  100. Yu, K.-Y.C. and Bricker, D.L. (1993), Analysis of a Markov chain model of a multistage manufacturing system with inspection, rejection, and rework, IIE Transactions, Vol. 25, No. 1, pp. 109–112.

    Google Scholar 

  101. Zimmern, B. (1956), Etudes de la propagation des arrets aleatoires dans les chaines de production, Review Statistical Applications, Vol. 4, pp. 85–104.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Economics, Aristotle University of Thessaloniki, 541 24, Thessaloniki, Greece

    Chrissoleon T. Papadopoulos

  2. Department of Business Administration, University of the Aegean, Michalon 8, 821 00, Chios, Greece

    Michael J. Vidalis

  3. Department of Industrial Engineering, National University of Ireland University College Galway, University Road, Galway, Ireland

    Michael E. J. O’Kelly

  4. Department of Management Science, University of Economics & Business, 104 34, Athens, Greece

    Diomidis Spinellis

Authors
  1. Chrissoleon T. Papadopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael J. Vidalis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael E. J. O’Kelly
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Diomidis Spinellis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chrissoleon T. Papadopoulos .

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Papadopoulos, C.T., Vidalis, M.J., O’Kelly, M.E., Spinellis, D. (2009). Evaluative Models of Discrete Part Production Lines. In: Analysis and Design of Discrete Part Production Lines. Springer Optimization and Its Applications, vol 31. Springer, New York, NY. https://doi.org/10.1007/978-0-387-89494-2_2

Download citation

Publish with us

Policies and ethics

Search

Navigation