OR Spectrum

, Volume 40, Issue 1, pp 1–21 | Cite as

Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal

  • Stefan Schwerdfeger
  • Nils Boysen
  • Dirk BriskornEmail author
Regular Article


Integrating far-distant suppliers, e.g., from low-wage countries and other currency areas, into concerted just-in-time (JIT) supply concepts is a delicate planning task. One enabler, e.g., often applied in the automotive industry, is an intermediate cross-docking terminal. Such a cross-dock located in close vicinity to the targeted plant is supplied from far-distant suppliers (as JIT as the long distance allows). The ultimate JIT demands are, then, assembled in the cross-dock from intermediate storage and delivered to the close-by plant in a concerted manner. This paper treats the scheduling of the JIT deliveries from the cross-dock toward the plant. Specifically, we aim to minimize the size of the vehicle fleet required to deliver all part containers within their given JIT intervals and without violating the vehicles’ capacities. We introduce suited solution procedures and investigate managerial aspects, such as the impact of the JIT intervals, the distance of the cross-dock, and the standardization of containers on the required vehicle fleet.


Just-in-time Automotive industry Part logistics Vehicle scheduling 


  1. Agnetis A, Aloulou MA, Fu L-L (2014) Coordination of production and interstage batch delivery with outsourced distribution. Eur J Oper Res 238:130–142CrossRefGoogle Scholar
  2. Agnetis A, Aloulou MA, Fu L-L, Kovalyov MY (2015) Two faster algorithms for coordination of production and batch delivery: a note. Eur J Oper Res 241:927–930CrossRefGoogle Scholar
  3. Boysen N, Fliedner M (2010) Cross dock scheduling: classification, literature review and research agenda. Omega 38:413–422CrossRefGoogle Scholar
  4. Boysen N, Zenker M (2013) A decomposition approach for the car resequencing problem with selectivity banks. Comput Oper Res 40:98–108CrossRefGoogle Scholar
  5. Boysen N, Emde S, Hoeck M, Kauderer M (2015) A survey on part logistics in the automotive industry. Eur J Oper Res 242:107–120CrossRefGoogle Scholar
  6. Boysen N, Briskorn D, Emde S (2016) Just-in-time vehicle scheduling with capacity constraints. IIE Trans 48:134–145CrossRefGoogle Scholar
  7. Brucker P, Kravchenko SA (2008) Scheduling jobs with equal processing times and time windows on identical parallel machines. J Sched 11:229–237CrossRefGoogle Scholar
  8. Buijs P, Vis IF, Carlo HJ (2014) Synchronization in cross-docking networks: a research classification and framework. Eur J Oper Res 239:593–608CrossRefGoogle Scholar
  9. Coffman EG Jr, Garey MR, Johnson DS (1996) Approximation algorithms for bin packing: a survey. In: Hochbaum DS (ed) Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, pp 46–93Google Scholar
  10. Condotta A, Knust S, Shakhlevich NV (2010) Parallel batch scheduling of equal-length jobs with release and due dates. J Sched 13:463–477CrossRefGoogle Scholar
  11. De Souza MC, de Carvalho CR, Brizon WB (2008) Packing items to feed assembly lines. Eur J Oper Res 184:480–489CrossRefGoogle Scholar
  12. Drexl M (2012) Synchronization in vehicle routing—a survey of VRPs with multiple synchronization constraints. Transp Sci 46:297–316CrossRefGoogle Scholar
  13. Fliedner M, Briskorn D, Boysen N (2016) Vehicle scheduling under the warehouse-on-wheels policy. Discrete Appl Math 205:52–61CrossRefGoogle Scholar
  14. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New YorkGoogle Scholar
  15. Gendreau M, Laporte G, Semet F (2004) Heuristics and lower bounds for the bin-packing problem with conflicts. Comput Oper Res 31:347–358CrossRefGoogle Scholar
  16. Golumbic MC (1977) The complexity of comparability graph recognition and coloring. Computing 18:199–208CrossRefGoogle Scholar
  17. Jansen K, Öhring S (1997) Approximation algorithms for time constrained scheduling. Inf Comput 132:85–108CrossRefGoogle Scholar
  18. Khanafer A, Clautiaux F, Talbi EG (2010) New lower bounds for bin packing problems with conflicts. Eur J Oper Res 206:281–288CrossRefGoogle Scholar
  19. Koberstein A, Lukas E, Naumann M (2013) Integrated strategic planning of global production networks and financial hedging under uncertain demands and exchange rates. BuR Bus Res 6:215–240CrossRefGoogle Scholar
  20. Koehler F, Khuller S (2013) Optimal batch schedules for parallel machines. In: Proceedings of the 13th annual algorithms and data structures symposiumGoogle Scholar
  21. Ladier AL, Alpan G (2016) Cross-docking operations: current research versus industry practice. Omega 62:145–162CrossRefGoogle Scholar
  22. Maknoon Y, Laporte G (2017) Vehicle routing with cross-dock selection. Comput Oper Res 77:254–266CrossRefGoogle Scholar
  23. Muritiba AEF, Iori M, Malaguti E, Toth P (2010) Algorithms for the bin packing problem with conflicts. INFORMS J Comput 22:401–415CrossRefGoogle Scholar
  24. Sadykov R, Vanderbeck F (2013) Bin packing with conflicts: a generic branch-and-price algorithm. INFORMS J Comput 25:244–255CrossRefGoogle Scholar
  25. Schwarz LB (1989) A model for assessing the value of warehouse risk-pooling: risk-pooling over outside-supplier leadtimes. Manag Sci 35:828–842CrossRefGoogle Scholar
  26. Tarantilis CD (2013) Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking. Optim Lett 7:1583–1596CrossRefGoogle Scholar
  27. Van Belle J, Valckenaers P, Cattrysse D (2012) Cross-docking: state of the art. Omega 40:827–846CrossRefGoogle Scholar
  28. Wagner SM, Silveira-Camargos V (2011) Decision model for the application of just-in-sequence. Int J Prod Res 49:5713–5736CrossRefGoogle Scholar
  29. Wen M, Larsen J, Clausen J, Cordeau JF, Laporte G (2009) Vehicle routing with cross-docking. J Oper Res Soc 60:1708–1718CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  • Stefan Schwerdfeger
    • 1
  • Nils Boysen
    • 2
  • Dirk Briskorn
    • 3
    Email author
  1. 1.Lehrstuhl für Management ScienceFriedrich-Schiller-Universität JenaJenaGermany
  2. 2.Lehrstuhl für Operations ManagementFriedrich-Schiller-Universität JenaJenaGermany
  3. 3.Professur für BWL, insbesondere Produktion und LogistikBergische Universität WuppertalWuppertalGermany

Personalised recommendations