×

A mixed integer programming model for solving real-time truck-to-door assignment and scheduling problem at cross docking warehouse. (English) Zbl 1346.90106

Summary: This paper addresses the problem at the inbound phase at the cross docking warehouse. The fundamental issues in cross docking facility is to assign the incoming truck to the door and to coordinate the sequences of the trucks in order to minimize the completion time at the inbound phase. Using the theories and methodologies of assignment and scheduling, the paper on hand proposes a mixed integer programming model for solving the truck-to-door assignment and scheduling problem with the objective to minimize the total service time of trucks. Meanwhile, reduce the waiting time of trucks before being served at the designated door. A preliminary computation is conducted to verify the logic of the mathematical model proposed.

MSC:

90B06 Transportation, logistics and supply chain management
90B35 Deterministic scheduling theory in operations research
90C11 Mixed integer programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] D. Agustina, A review: Mathematical modles for cross docking planning,, International Journal of Engineering Business Management, 2, 47 (2010) · doi:10.5772/9717
[2] U. Aickelin, Simulation optimization of the crossdock door assignmnet problem,, Proceedings of the Operational Research Society Simulation Workshop 2006 (SW 2006) (2006)
[3] A. Amini, Cross-docking truck scheduling with the arrival times for inbound trucks and the learning effect for unloading/loading processes,, Production & Manufacturing Research, 2, 784 (2014)
[4] U. M. Apte, Effective cross docking for improving distribution efficiencies,, International Journal of Logistics, 3, 291 (2000) · doi:10.1080/713682769
[5] A. B. Arabani, A cross-docking scheduling problem with sub-population multi-objective algorithms,, The International Journal of Advanced Manufacturing Technology, 58, 741 (2012)
[6] M. Bachlaus, Designing an integrated multi-echelon agile supply chain network: A hybrid taguchi-particle swarm optimization approach,, Journal of Intelligent Manufacturing, 19, 747 (2008) · doi:10.1007/s10845-008-0125-1
[7] J. J. Bartholdi, The best shape for a crossdock,, Transportation Science, 38, 235 (2004) · doi:10.1287/trsc.1030.0077
[8] L. Berghman, Optimal solutions for a dock assignment problem with trailer transportation,, Annals of Operations Research, 213, 3 (2014) · Zbl 1296.90068 · doi:10.1007/s10479-011-0971-7
[9] N. Boysen, Truck scheduling at zero-inventory cross docking terminals,, Computers & Operations Research, 37, 32 (2010) · Zbl 1171.90391 · doi:10.1016/j.cor.2009.03.010
[10] N. Boysen, Truck scheduling in cross-docking terminals with fixed outbound departures,, OR spectrum, 35, 479 (2013) · Zbl 1263.90039 · doi:10.1007/s00291-012-0311-6
[11] F. Chen, Minimizing the makespan in a two-machine cross-docking flow shop problem,, European Journal of Operational Research, 193, 59 (2009) · Zbl 1152.90433 · doi:10.1016/j.ejor.2007.10.051
[12] R. Chen, Scheduling problems in cross docking,, in Combinatorial Optimization and Applications, 421 (2009) · Zbl 1246.90050 · doi:10.1007/978-3-642-02026-1_40
[13] H. Davoudpour, A genetic algorithm for truck scheduling in cross docking systems,, Journal of American Science, 8, 96 (2012)
[14] W. N. A. W. A. Fatthi, Estimating unloading time at cross docking centre by using fuzzy logic,, Research Journal of Business Management, 7, 1 (2013)
[15] M. Golias, A bi-objective model to minimize service and storage time at a cross dock facility,, in 51st Annual Transportation Research Forum (2010)
[16] S. S. Heragu, An efficient model for allocating products and designing a warehouse,, Progress in Material Handling Research, 143 (2004)
[17] C. M. Joo, Scheduling compound trucks in multi-door cross-docking terminals,, The International Journal of Advanced Manufacturing Technology, 64, 977 (2013) · doi:10.1007/s00170-012-4035-1
[18] J. Karlof, <em>Integer Programming: Theory and Practice, chapter 4: Decomposition in Integer Linear Programming</em>,, Florida · Zbl 1073.90002
[19] S. Kreipl, Planning and scheduling in supply chains: an overview of issues in practice,, Production and Operations management, 13, 77 (2004) · doi:10.1111/j.1937-5956.2004.tb00146.x
[20] V. B. Kreng, The benefits of a cross-docking delivery strategy: a supply chain collaboration approach,, Production Planning and Control, 19, 229 (2008)
[21] Y. Kuo, Optimizing truck sequencing and truck dock assignment in a cross docking system,, Expert Systems with Applications, 40, 5532 (2013) · doi:10.1016/j.eswa.2013.04.019
[22] R. Larbi, Scheduling of transhipment operations in a single strip and stack doors crossdock,, in 19th International Conference on Production Research (2007)
[23] R. Larbi, Scheduling transshipment operations in a multiple inbound and outbound door crossdock,, in International Conference on Computers & Industrial Engineering, 227 (2009) · doi:10.1109/ICCIE.2009.5223927
[24] K. Lee, Genetic algorithms for door-assigning and sequencing of trucks at distribution centers for the improvement of operational performance,, Expert Systems with Applications, 39, 12975 (2012) · doi:10.1016/j.eswa.2012.05.057
[25] Z. Li, Crossdocking planning and scheduling: Problems and algorithms,, SIMTech Technical Reports, 10, 159 (2009)
[26] L. A. Li, Crossdocking-jit scheduling with time windows,, Journal of the Operational Research Society, 55, 1342 (2004) · Zbl 1088.90026 · doi:10.1057/palgrave.jors.2601812
[27] T. Liao, Simultaneous dock assignment and sequencing of inbound trucks under a fixed outbound truck schedule in multi-door cross docking operations,, International Journal of Production Economics, 141, 212 (2013) · doi:10.1016/j.ijpe.2012.03.037
[28] J. T. Mentzer, Defining supply chain management,, Journal of Business logistics, 22, 1 (2001) · doi:10.1002/j.2158-1592.2001.tb00001.x
[29] Z. Miao, Transshipment service through crossdocks with both soft and hard time windows,, Annals of Operations Research, 192, 21 (2012) · Zbl 1233.90286 · doi:10.1007/s10479-010-0780-4
[30] B. Naderi, A multiobjective iterated greedy algorithm for truck scheduling in cross-dock problems,, Journal of Industrial Engineering, 2014 (2014) · doi:10.1155/2014/128542
[31] Y. Pochet, <em>Production planning by mixed integer programming</em>,, US: Springer Science & Business Media (2006) · Zbl 1102.90039
[32] R. Sadykov, Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost,, Annals of Operations Research, 201, 423 (2012) · Zbl 1260.90097 · doi:10.1007/s10479-012-1232-0
[33] M. Shakeri, A generic model for crossdock truck scheduling and truck-to-door assignment problems,, in 6th IEEE International Conference on Industrial Informatics, 857 (2008) · doi:10.1109/INDIN.2008.4618221
[34] M. Shakeri, A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock,, Computers & Operations Research, 39, 2564 (2012) · Zbl 1251.90188 · doi:10.1016/j.cor.2012.01.002
[35] A. Shuib, A review on quantitative approaches for dock door assignment in cross-docking,, International Journal on Advanced Science, 2, 30 (2012)
[36] R. Tavakkoli-Moghaddam, A new model for cross dock scheduling considering product arrangement,, International Proceedings of Economics Development & Research, 35 (2012)
[37] J. Van Belle, A tabu search approach to the truck scheduling problem with multiple docks and time windows,, Computers & Industrial Engineering, 66, 818 (2013)
[38] I. F. Vis, Positioning of goods in a cross-docking environment,, Computers & Industrial Engineering, 54, 677 (2008) · doi:10.1016/j.cie.2007.10.004
[39] W. Yu, Scheduling of inbound and outbound trucks in cross docking systems with temporary storage,, European Journal of Operational Research, 184, 377 (2008) · Zbl 1278.90177 · doi:10.1016/j.ejor.2006.10.047
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.