PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Scheduling trucks in a multi-door cross-docking system with time windows

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
Cross-docking is a strategy that distributes products directly from a supplier or manufacturing plant to a customer or retail chain, reducing handling or storage time. This study focuses on the truck scheduling problem, which consists of assigning each truck to a door at the dock and determining the sequences for the trucks at each door considering the time-window aspect. The study presents a mathematical model for door assignment and truck scheduling with time windows at multi-door cross-docking centers. The objective of the model is to minimize the overall earliness and tardiness for outbound trucks. Simulated annealing (SA) and tabu search (TS) algorithms are proposed to solve largesized problems. The results of the mathematical model and of meta-heuristic algorithms are compared by generating test problems for different sizes. A decision support system (DSS) is also designed for the truck scheduling problem for multi-door cross-docking centers. Computational results show that TS and SA algorithms are efficient in solving large-sized problems in a reasonable time.
Rocznik
Strony
344--362
Opis fizyczny
Bibliogr. 29 poz., rys., wykr., tab.
Twórcy
autor
  • Eskisehir Osmangazi University, Eskisehir Vocational School, Machinery Program, Eskisehir, Turkey
autor
  • Eskisehir Osmangazi University, Department of Industrial Engineering, Eskisehir, Turkey
Bibliografia
  • [1] M.U. Apte and S. Viswanathan, “Effective cross docking for improving distribution efficiencies”, International Journal of Logistics: Research and Applications, 3, 291–302 (2000).
  • [2] B. Vahdani and M. Zandieh, “Scheduling trucks in cross-docking systems: Robust meta-heuristics”, Computers & Industrial Engineering, 58, 12–24 (2010).
  • [3] D.L. McWilliams, P.M. Stanfield, and C.D. Geiger, “The parcel hub scheduling problem: A simulation-based solution approach”, Computers & Industrial Engineering, 49, 393–412 (2005).
  • [4] W. Yu and P.J. Egbelu, “Scheduling of inbound and outbound trucks in cross docking systems with temporary storage”, European Journal of Operational Research, 184, 377–396 (2008).
  • [5] F. Chen and C.Y. Lee, “Minimizing the makespan in two-machine cross-docking flow shop problem”, European Journal of Operational Research, 193, 59–72 (2009).
  • [6] A.R. Boloori Arabani, S.M.T. Fatemi Ghomi and M. Zandieh, “Meta-heuristics implementation for scheduling of trucks in a cross-docking system with temporary storage”, Expert Systems with Applications, 38, 1964–1979 (2011).
  • [7] J. Van Belle, P. Valckenaers, and D. Cattrysse, “Cross-docking: State of the art”, Omega, 40, 827–846 (2012).
  • [8] A.R. Boloori Arabani, S.M.T. Fatemi Ghomi, and M. Zandieh, “A multi-criteria cross-docking scheduling with just-in-time approach”, International Journal of Advanced Manufacturing Technology, 49, 741–756 (2010).
  • [9] R. Soltani and S.J. Sadjadi, “Scheduling trucks in cross-docking systems:a robust meta-heuristics approach”, Transportation Research Part E:Logistics and Transportation Review, 46, 650–666 (2010).
  • [10] A.R. Boloori Arabani, M. Zandieh, and S.M.T. Fatemi Ghomi, “A cross-docking scheduling problem with sub-population multi-objective algorithms”, International Journal of Advanced Manufacturing Technology, 58, 741–761 (2012).
  • [11] A. Mohtashami, “Scheduling trucks in cross docking systems with temporary storage and repetitive pattern for shipping trucks”, Applied Soft Computing, 36, 468‒486 (2015).
  • [12] A. Amini and R. Tavakkoli-Moghaddam, “A bi-objective truck scheduling problem in a cross-docking center with probability of breakdown for trucks”, Computers and Industrial Engineering, 96, 181‒190 (2016).
  • [13] D.L. McWilliams, P.M. Stanfield, and C.D. Geiger, “Minimizing the completion time of the transfer operations in a central parcel consolidation terminal with unequal-batch-size inbound trailers”, Computers & Industrial Engineering, 54(4),709–720 (2008).
  • [14] G. Alpan, R. Larbi, and B. Penz, “A bounded dynamic programming approach to schedule operations in a cross docking platform”, Computers and Industrial Engineering, 60, 385–396 (2011).
  • [15] N. Boysen, D. Briskorn, and M. Tschöke, “Truck scheduling in cross-docking terminals with fixed outbound departure”, OR Spectrum, 35, 479–504 (2013).
  • [16] D. Konur and M.M. Golias, “Cost-stable truck scheduling at a cross-dock facility with unknown truck arrivals: A meta-heuristic approach”, Transportation Research Part E, 49, 71–91 (2013).
  • [17] T.W. Liao, P.J. Egbelu, and P.C. Chang, “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–229 (2013).
  • [18] N. Boysen, “Truck scheduling at zero-inventory cross docking terminals”, Computers & Operations Research, 37, 32–41 (2010).
  • [19] K. Lee, B.S. Kim, and C.M. Joo, “Genetic algorithms for door-assigning and sequencing of trucks at distribution centers for the improvement of operational performance”, Expert Systems with Applications, 39, 12975–12983 (2012).
  • [20] C.M. Joo and B.S. Kim, “ Scheduling compound trucks in multidoor crossdocking terminals”, International Journal of Advanced Manufacturing Technology, 64, 977–988 (2013).
  • [21] J. Van Belle, P. Valckenaers, G.V. Berghe, and D. Cattrysse, “A tabu search approach to the truck scheduling problem with multiple docks and time windows”, Computers and Industrial Engineering, 66, 818–826 (2013).
  • [22] M.T. Assadi and M. Bagheri, “Scheduling trucks in a multiple-door cross docking system with unequal ready times”, European Journal of Industrial Engineering, 10, 103‒125 (2016).
  • [23] N. Boysen and M. Fliedner, “Cross dock scheduling: Classification, literature review and research agenda”, Omega, 38, 413–422 (2010).
  • [24] S. Kaplan and G. Rabadi, “Exact and heuristic algorithms for the aerial refueling parallel machine scheduling problem with due date-to-deadline window and ready times”, Computers & Industrial Engineering, 62, 776–785 (2012).
  • [25] Y. H. Lee and M. Pinedo, “Theory and Methodology: Scheduling jobs on parallel machines with sequence dependent setup times”, European Journal of Operational Research, 100, 464‒474 (1997).
  • [26] M. Pinedo, Scheduling: Theory, Algorithms, and Systems. (2nd ed.). Prentice Hall, 2002.
  • [27] I. Saricicek and C. Celik, “Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness”, Applied Mathematical Modelling, 35, 4117‒4126 (2011).
  • [28] F. Glover, Tabu Search-Part I, ORSA J. Comput. 1 (3), 190–206 (1989).
  • [29] F. Glover, Tabu Search-Part II, ORSA J. Comput. 2 (1) 4–32 (1990).
Uwagi
EN
This work is supported by the Committee of Eskisehir Osmangazi University Scientific Research Projects under the Project Code 2015‒734, titled “Door Assignment and Truck Scheduling in Cross-Docking”.
PL
Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-27922cdb-ae2c-4d74-83e4-7f9d6251981a
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.