Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Routing with Early Ordering for Just-In-Time Manufacturing Systems

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

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

Included in the following conference series:

  • 1136 Accesses

Abstract

Parts required in Just-In-Time manufacturing systems are usually picked up from suppliers on a daily basis, and the routes are determined based on average demand. Because of high demand variance, static routes result in low truck utilization and occasional overflow. Dynamic routing with limited early ordering can significantly reduce transportation costs. An integrated mixed integer programming model is presented to capture transportation cost, early ordering inventory cost and stop cost with the concept of rolling horizon. A four-stage heuristic algorithm is developed to solve a real-life problem. The stages of the algorithms are: determining the number of trucks required, grouping, early ordering, and routing. Significant cost savings is estimated based on real data.

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

Access this chapter

Log in via an institution

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. Askin, R., Golderg, J.: Design and Analysis of Lean Manufacturing. John Wiley & Sons, New York (2002)

    Google Scholar 

  2. Monden, Y.: Toyota production system: An Integrated Approach to Just-In-Time. Institute of Industrial Engineering, Norcross, GA, 3rd edn. (1993)

    Google Scholar 

  3. Dror, M., Trudeau, P.: Savings by Split Delivery Routing. Transportation Science 23, 141–145 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dror, M., Laporte, G., Trudeau, P.: Vehicle Routing with Split Delivery. Discrete Applied Mathematics 50, 239–254 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bredström, D., Rönnqvist, M.: Integrated Production Planning and Route Scheduling in Pulp Mill Industry. In: Proceedings of the 35th Hawaii International Conference on System Sciences (2002)

    Google Scholar 

  6. Belenguer, J.M., Martinez, M.C., Mota, E.: Lower Bound for the Split Delivery Vehicle Routing Problem. Operations Research 48, 801–810 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Archetti, C., Mansini, R., Speranza, M.G.: The Split Delivery Vehicle Routing Problem with Small Capacity. Technical Report, Department of Quantitative Methods, University of Brescia (2001)

    Google Scholar 

  8. Lee, C.G., Epelman, M., White, C.C.: A Shortest Path Approach to the Multiple-vehicle Routing with Split Picks-up. To appear in Transportation Research - Part B (2005)

    Google Scholar 

  9. ILOG, ILOG CPLEX 9.0 User’s Manual (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Mississippi State University, P.O. Box 9542, Mississippi State, MS, 39762, USA

    Mingzhou Jin, Kai Liu & Burak Eksioglu

Authors
  1. Mingzhou Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kai Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Burak Eksioglu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jin, M., Liu, K., Eksioglu, B. (2006). Routing with Early Ordering for Just-In-Time Manufacturing Systems. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_79

Download citation

  • DOI: https://doi.org/10.1007/11751595_79

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation