Skip to main content

Collision Probability in an In-Line Machines Model

  • Chapter
Book cover Transactions on Computational Science XIII

Part of the book series: Lecture Notes in Computer Science ((TCOMPUTATSCIE,volume 6750))

Abstract

This paper presents a simple model of the manufacturing line which focuses on the performance of collision probability, and a method of application to the manufacture of Flat Panel Displays (FPDs) and semiconductors. We derive an approximate formula of the collision probability. When the processing time follows a normal distribution, we also did simulations to evaluate the exact probabilities and confirm that our approximation approach yields reasonable results compared to the simulated results. Moreover, we simplify our approximate formula of the collision probability. Concretely speaking, we derive a closed form formula when the processing time follows an exponential distribution. Finally, we present an optimization problem with the collision probability and show a method to solve it.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chiba, E., Asano, T., Ibaraki, T.: A method for the buffer allocation problem with collision probability using computer simulation. IPSJ SIG Technical Reports, 2006-AL-108, pp. 57–63 (2006)

    Google Scholar 

  2. Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44, 510–525 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Heyman, D.P., Sobel, M.J. (eds.): Stochastic Models: Handbooks in Operations Research and Management Science, vol. 2. North-Holland, Amsterdam (1990)

    Google Scholar 

  4. Kleinrock, L.: Queueing Systems, Volume I: Theory. Wiley Interscience, Hoboken (1975)

    MATH  Google Scholar 

  5. Kunisawa, K., Honma, T. (eds.): Applied Queueing Dictionary. Hirokawa Shoten (1971)

    Google Scholar 

  6. Moriguchi, S., Udagawa, K., Hitotsumatsu, S.: Mathematical Formulae I. Iwanami Shoten (1956)

    Google Scholar 

  7. Pinedo, M.: Minimizing the expected makespan in stochastic flow shops. Operations Research 30, 148–162 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  8. Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 2nd edn., Section 13.2. Prentice Hall, Englewood Cliffs (2002)

    MATH  Google Scholar 

  9. http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html

  10. http://www.screen.co.jp/fpd/process/index_e.html

  11. http://www.screen.co.jp/lsi/process/index_e.html

  12. http://www.wolfram.com/index.en.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chiba, E., Asano, T., Miura, T., Katoh, N., Mitsuka, I. (2011). Collision Probability in an In-Line Machines Model. In: Gavrilova, M.L., Tan, C.J.K. (eds) Transactions on Computational Science XIII. Lecture Notes in Computer Science, vol 6750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22619-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22619-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22618-2

  • Online ISBN: 978-3-642-22619-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics