Jena Research Papers in Business and Economics Optimally Routing and Scheduling Tow Trains for JIT-Supply of Mixed-Model Assembly Lines

In recent years, more and more automobile producers adopted the supermarket-concept to enable a flexible and reliable Just-in-Time (JIT) part supply of their mixed-model assembly lines. Within this concept, a supermarket is a decentralized in-house logistics area where parts are intermediately stored and then loaded on small tow trains. These tow trains travel across the shop floor on specific routes to make frequent small-lot deliveries which are needed by the stations of the line. To enable a reliable part supply in line with the JIT-principle, the interdependent problems of routing, that is, partitioning stations to be supplied among tow trains, and scheduling, i.e., deciding on the start times of each tow train’s tours through its assigned stations, need to be solved. This paper introduces an exact solution procedure which solves both problems simultaneously in polynomial runtime. Additionally, management implications regarding the trade-off between number and capacity of tow trains and in-process inventory near the line are investigated within a comprehensive computational study.

[1]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[2]  Nils Boysen,et al.  Optimally locating in-house logistics areas to facilitate JIT-supply of mixed-model assembly lines , 2012 .

[3]  Thom J. Hodgson,et al.  Optimal hybrid push/pull control strategies for a parallel multistage system: Part II , 1991 .

[4]  Maurizio Faccio,et al.  “Supermarket warehouses”: stocking policies optimization in an assembly-to-order environment , 2010 .

[5]  James Vatalaro Implementing a Mixed Model Kanban System: The Lean Replenishment Technique for Pull Production , 2005 .

[6]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[7]  Hans-Otto Günther,et al.  Part feeding at high-variant mixed-model assembly lines , 2012 .

[8]  Moshe Dror,et al.  A computational comparison of algorithms for the inventory routing problem , 1985 .

[9]  Loren Paul Rees,et al.  A comparative analysis of an MRP lot-for-lot system and a Kanban system for a multistage production operation , 1989 .

[10]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[11]  David M. Miller,et al.  A capacitated vehicle routing problem for just-in-time delivery , 1999 .

[12]  Matthias Holweg,et al.  The genealogy of lean production , 2007 .

[13]  C. P. Bajaj,et al.  Some constrained shortest-route problems , 1971, Unternehmensforschung.

[14]  Wolfgang Gaul,et al.  On Constrained Shortest-Route Problems , 1976 .

[15]  Marshall L. Fisher,et al.  A Periodic Inventory Routing Problem at a Supermarket Chain , 2004, Oper. Res..

[16]  Nils Boysen,et al.  Cross dock scheduling: Classification, literature review and research agenda , 2010 .

[17]  Nils Boysen,et al.  Optimally loading tow trains for just-in-time supply of mixed-model assembly lines , 2012 .

[18]  Jean-Yves Potvin,et al.  Vehicle Routing , 2009, Encyclopedia of Optimization.

[19]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[20]  Michael S. Spencer Production planning in a MRP/JIT repetitive manufacturing environment , 1995 .

[21]  Romesh Saigal,et al.  Letter to the Editor - A Constrained Shortest Route Problem , 1968, Oper. Res..

[22]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[23]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[24]  M. Savelsbergh,et al.  The Inventory Routing Problem , 1998 .

[25]  Walter Ukovich,et al.  Dynamic routing-and-inventory problems: a review , 1998 .

[26]  Nils Boysen,et al.  Jena Research Papers in Business and Economics Optimally Loading Clocked Tow Trains for JIT-Supply of Mixed-Model Assembly Lines , 2009 .