OR Spectrum

, Volume 35, Issue 2, pp 479–504 | Cite as

Truck scheduling in cross-docking terminals with fixed outbound departures

Regular Article

Abstract

At a cross-docking terminal, inbound shipments are directly transshipped across the terminal to designated outbound trucks, so that delays and inventories are kept as low as possible. We consider an operational truck scheduling problem, where a dock door and a start time have to be assigned to each inbound truck. A set of outbound trucks is scheduled beforehand and, therefore, departure times are fixed. If a shipment is not unloaded, transshipped to the outbound gate and loaded onto the designated outbound truck before its departure, we consider the shipments’s value as lost profit. The objective is to minimize total lost profit. This paper at hand formalizes the resulting truck scheduling problem. We settle its computational complexity and develop heuristics (namely, decomposition procedures and simulated annealing) in order to tackle the problem. We show the efficiency of these heuristics by means of a computational study. Last but not least, a case study is presented.

Keywords

Cross-docking terminal Truck scheduling Due dates  Heuristics 

References

  1. Aarts, E., Korst, J., van Laarhoven, J.: Simulated annealing. In: Aarts, E., Lenstra, J. (eds.) Local Search in Combinatorial, Optimization, pp. 91–120 (1997)Google Scholar
  2. Boysen N (2010) Truck scheduling at zero-inventory crossdocking terminals. Comput. Oper. Res. 37:32–41CrossRefGoogle Scholar
  3. Boysen N, Fliedner M (2010) Cross dock scheduling: classification, literature review and research agenda. Omega 38:413–422CrossRefGoogle Scholar
  4. Boysen N, Fliedner M, Scholl A (2010) Scheduling inbound and outbound trucks at cross docking terminals. OR Spect. 32:135–161CrossRefGoogle Scholar
  5. Briskorn D, Choi B-C, Lee K, Leung J, Pinedo M (2010) Complexity of single machine scheduling subject to nonnegative inventory constraints. Eur. J. Oper. Res. 207(2):605–619CrossRefGoogle Scholar
  6. Brucker P (2004) Sched. Algorithms. Springer, BerlinGoogle Scholar
  7. Chen F, Lee C-Y (2009) Minimizing the makespan in a two-machine cross-docking flow shop problem. Eur. J. Oper. Res. 193:59–72CrossRefGoogle Scholar
  8. Chen F, Song K (2009) Minimizing makespan in two-stage hybrid cross docking scheduling problem. Comput. Oper. Res. 36:2066–2073CrossRefGoogle Scholar
  9. Chen Z, Powell W (1999) Solving parallel machine scheduling problems by column generation. Informs J. Comput. 11:78–94CrossRefGoogle Scholar
  10. Forger, G.: Ups starts world’s premiere cross-docking operation. In: Modern Material Handling, pp. 36–38 (1995)Google Scholar
  11. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimisation and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5:236–287Google Scholar
  12. Gue K (1999) The effect of trailer scheduling on the layout of freight terminals. Transp. Sci. 33:419–428CrossRefGoogle Scholar
  13. Held M, Karp R (1962) A dynamic programming approach to sequencing problems. SIAM J. 10:196–210CrossRefGoogle Scholar
  14. Kellerer H, Pferschy U, Pisinger D (2004) Knapsack Problems, 1st edn. Springer, BerlinCrossRefGoogle Scholar
  15. Kirkpatrick S, Gelatt CD, Vecchi MPGR (1983) Optimization by simulated annealing. Sci. New Series 220(4598):671–680Google Scholar
  16. Lawler E (1977) A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1:331–342CrossRefGoogle Scholar
  17. Lowerre, B T (1976) The HARPY Speech Recognition System. PhD thesis, Carnegie-Mellon University, USAGoogle Scholar
  18. M’Hallah R, Bulfin R (2005) Minimizing the weighted number of tardy jobs on parallel processors. Eur. J. Oper. Res. 160(2):471–484CrossRefGoogle Scholar
  19. Miao Z, Lim A, Ma H (2009) Truck dock assignment with operational time constraint within crossdocks. Eur. J. Oper. Res. 192(1):105–115CrossRefGoogle Scholar
  20. Ow P, Morton T (1988) Filtered beam search in scheduling. Int. J. Prod. Res. 26:35–62CrossRefGoogle Scholar
  21. Sabuncuoglu I, Gocgun Y, Erel E (2008) Backtracking and exchange of information: methods to enhance a beam search algorithm for assembly line scheduling. Eur. J. Oper. Res. 186:915–930CrossRefGoogle Scholar
  22. Stalk G, Evans P, Shulman L (1992) Competing on capabilities: the new role of corporate strategy. Harvard Bus. Rev. 70(2):57–69Google Scholar
  23. Van den Akker J, Hoogeveen J, Van de Velde S (1999) Parallel machine scheduling by column generation. Oper. Res. 47:862–872CrossRefGoogle Scholar
  24. Witt C (1998) Crossdocking: concepts demand choice. Mater. Handl. Eng. 53(7):44–49Google Scholar
  25. Yu W, Egbelu PJ (2008) Scheduling of inbound and outbound trucks in cross docking systems with temporary storage. Eur. J. Oper. Res. 184:377–396CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Lehrstuhl für Operations ManagementFriedrich-Schiller-Universität JenaJenaGermany
  2. 2.Lehrstuhl für BWL, insb. Quantitative PlanungUniversität SiegenSiegenGermany
  3. 3.Fraunhofer Center for Maritime Logistics and Services CMLHamburgGermany

Personalised recommendations