Skip to main content
Springer Nature Link
Log in

Productivity Enhancement through Lot Size Optimization

  • Conference paper
Cellular Automata (ACRI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6350))

Included in the following conference series:

  • 1768 Accesses

Abstract

We propose a simple model of a production plant that is based on the ASEP and simulate the dependence of the lead time T on the lot size r. Then, we derive an analytical description of the simulation results based on exact results for the single-species ASEP. Furthermore, we determine the optimum lot size r c and investigate dependence of r c on several parameters used in the simulations.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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.

Similar content being viewed by others

References

  1. Fujimoto, T.: Introduction of Production Management. Nikkei Publishing Inc. (2001)

    Google Scholar 

  2. Rajewsky, N., Santen, L., Schadschneider, A., Schreckenberg, M.: The Asymmetric Exclusion Process: Comparison of Update Procedures. J. Stat. Phys. 92, 151 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Evans, M.R., Rajewsky, N., Speer, E.R.: Exact solution of a cellular automaton for traffic. J. Stat. Phys. 95, 45 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. de Gier, J., Nienhuis, B.: Exact stationary state for an asymmetric exclusion process with fully parallel dynamics. Phys. Rev. E 59, 4899 (1999)

    Article  Google Scholar 

  5. Johansson, K.: Shape Fluctuations and Random Matrices. Commun. Math. Phys. 209, 437–476 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering, The University of Tokyo, Japan

    Takumi Minemura

  2. Research Center for Advanced Science and Technology, Univ. of Tokyo, Japan

    Katsuhiro Nishinari

  3. PRESTO, Japan Science and Technology Agency, Japan

    Katsuhiro Nishinari

  4. Institut für Theoretische Physik, Universität zu Köln, Germany

    Andreas Schadschneider

Authors
  1. Takumi Minemura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Katsuhiro Nishinari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas Schadschneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Complex Systems and Artificial Intelligence Research Center, University of Milano-Bicocca, Viale Sarca 336, Milano, Italy

    Stefania Bandini , Sara Manzoni  & Giuseppe Vizzari ,  & 

  2. University of Osaka Electro-Communication, 572-8530, Neyagawa, Osaka, Japan

    Hiroshi Umeo

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minemura, T., Nishinari, K., Schadschneider, A. (2010). Productivity Enhancement through Lot Size Optimization. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds) Cellular Automata. ACRI 2010. Lecture Notes in Computer Science, vol 6350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15979-4_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15979-4_65

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15978-7

  • Online ISBN: 978-3-642-15979-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics