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

  • Mingzhou Jin
  • Kai Liu
  • Burak Eksioglu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3982)


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.


Unit Load Rolling Horizon Capacitate Vehicle Rout Problem Split Delivery Early Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Askin, R., Golderg, J.: Design and Analysis of Lean Manufacturing. John Wiley & Sons, New York (2002)Google Scholar
  2. 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. 3.
    Dror, M., Trudeau, P.: Savings by Split Delivery Routing. Transportation Science 23, 141–145 (1989)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Dror, M., Laporte, G., Trudeau, P.: Vehicle Routing with Split Delivery. Discrete Applied Mathematics 50, 239–254 (1994)MATHCrossRefMathSciNetGoogle Scholar
  5. 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. 6.
    Belenguer, J.M., Martinez, M.C., Mota, E.: Lower Bound for the Split Delivery Vehicle Routing Problem. Operations Research 48, 801–810 (2000)MATHCrossRefMathSciNetGoogle Scholar
  7. 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. 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. 9.
    ILOG, ILOG CPLEX 9.0 User’s Manual (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mingzhou Jin
    • 1
  • Kai Liu
    • 1
  • Burak Eksioglu
    • 1
  1. 1.Department of Industrial EngineeringMississippi State UniversityMississippi StateUSA

Personalised recommendations