Truck scheduling at zero-inventory cross docking terminals

被引:125
作者
Boysen, Nils [1 ]
机构
[1] Univ Jena, Lehrstuhl Allgemeine Betriebswirtschaftslehre Ope, D-07743 Jena, Germany
关键词
Logistics; Food industry; Cross docking; Truck scheduling; Dynamic programming; ASSIGNMENT PROBLEM; CROSSDOCKING;
D O I
10.1016/j.cor.2009.03.010
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Handling freight at cross docking terminals constitutes a complex planning task which comprises several executive steps as shipments delivered by inbound trucks are to be unloaded, sorted according to their designated destinations, moved across the dock and finally loaded onto outbound trucks for an immediate delivery elsewhere in the distribution system. To enable an efficient synchronization of inbound and outbound flows, a careful planning of operations, e.g. by computerized scheduling procedures, becomes indispensable. This work treats a special truck scheduling problem arising in the (zero-inventory) cross docks of the food industry, where strict cooling requirements forbid an intermediate storage inside the terminal, so that all products are to be instantaneously loaded onto refrigerated outbound trucks. The problem is formalized such that different operational objectives, i.e. the flow time, processing time and tardiness of outbound trucks, are minimized. To solve the resulting truck scheduling problem suited exact and heuristic solution procedures are presented. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:32 / 41
页数:10
相关论文
共 26 条
[1]  
Aarts E.H. L., 1997, Local Search in Combinatorial Optimization, P91
[2]  
Apte U.M., 2000, International Journal of Logistics Research and Applications, V3, P291, DOI [10.1080/713682769, DOI 10.1080/713682769]
[3]   The best shape for a crossdock [J].
Bartholdi, JJ ;
Gue, KR .
TRANSPORTATION SCIENCE, 2004, 38 (02) :235-244
[4]   Reducing labor costs in an LTL crossdocking terminal [J].
Bartholdi, JJ ;
Gue, KR .
OPERATIONS RESEARCH, 2000, 48 (06) :823-832
[5]   Heuristics and exact algorithms for solving the Monden problem [J].
Bautista, J ;
Companys, R ;
Corominas, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (01) :101-113
[6]  
Bermudez R, 2001, MBTC1102 U ARK
[7]  
BOYSEN N, 2007, OR SPECTRUM IN PRESS
[8]   Sequencing mixed-model assembly lines to minimize part inventory cost [J].
Boysen, Nils ;
Fliedner, Malte ;
Scholl, Armin .
OR SPECTRUM, 2008, 30 (03) :611-633
[9]  
Campbell JF, 1994, Studies in Locational Analysis, V6, P31
[10]   AN IMPROVED DISCRETE DYNAMIC-PROGRAMMING ALGORITHM FOR ALLOCATING RESOURCES AMONG INTERDEPENDENT PROJECTS [J].
CARRAWAY, RL ;
SCHMIDT, RL .
MANAGEMENT SCIENCE, 1991, 37 (09) :1195-1200