IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v40y2018i2d10.1007_s00291-018-0510-x.html
   My bibliography  Save this article

Truck synchronization at single door cross-docking terminals

Author

Listed:
  • Antonino Chiarello

    (Università della Calabria)

  • Manlio Gaudioso

    (Università della Calabria)

  • Marcello Sammarra

    (Istituto di Calcolo e Reti ad Alte Prestazioni - CNR)

Abstract

We address the problem of synchronizing the loading and discharging operations of trucks at a particular cross-docking center, with one door at both the inbound and outbound sides, aiming at minimizing the makespan of the whole process. We propose a mixed integer linear model and a Lagrangian decomposition scheme. We derive conditions for optimally solving both the Lagrangian relaxation and the dual problems. Based on the theoretical results, we propose a Lagrangian heuristic for computing many feasible solutions and gathering the best one among them. An extensive computational experience validates our Lagrangian heuristic, also in comparison with a state-of-the-art benchmark solver and a heuristic algorithm from the literature.

Suggested Citation

  • Antonino Chiarello & Manlio Gaudioso & Marcello Sammarra, 2018. "Truck synchronization at single door cross-docking terminals," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 395-447, March.
  • Handle: RePEc:spr:orspec:v:40:y:2018:i:2:d:10.1007_s00291-018-0510-x
    DOI: 10.1007/s00291-018-0510-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-018-0510-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00291-018-0510-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chen, Feng & Lee, Chung-Yee, 2009. "Minimizing the makespan in a two-machine cross-docking flow shop problem," European Journal of Operational Research, Elsevier, vol. 193(1), pages 59-72, February.
    2. Buijs, Paul & Vis, Iris F.A. & Carlo, Héctor J., 2014. "Synchronization in cross-docking networks: A research classification and framework," European Journal of Operational Research, Elsevier, vol. 239(3), pages 593-608.
    3. Astorino, Annabella & Gaudioso, Manlio & Miglionico, Giovanna, 2018. "Lagrangian relaxation for the directional sensor coverage problem with continuous orientation," Omega, Elsevier, vol. 75(C), pages 77-86.
    4. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    5. Francesco Carrabs & Raffaele Cerulli & Manlio Gaudioso & Monica Gentili, 2013. "Lower and upper bounds for the spanning tree with minimum branch vertices," Computational Optimization and Applications, Springer, vol. 56(2), pages 405-438, October.
    6. Van Belle, Jan & Valckenaers, Paul & Cattrysse, Dirk, 2012. "Cross-docking: State of the art," Omega, Elsevier, vol. 40(6), pages 827-846.
    7. Yu, Wooyeon & Egbelu, Pius J., 2008. "Scheduling of inbound and outbound trucks in cross docking systems with temporary storage," European Journal of Operational Research, Elsevier, vol. 184(1), pages 377-396, January.
    8. Gupta, Jatinder N.D. & Stafford, Edward Jr., 2006. "Flowshop scheduling research after five decades," European Journal of Operational Research, Elsevier, vol. 169(3), pages 699-711, March.
    9. Boysen, Nils & Fliedner, Malte, 2010. "Cross dock scheduling: Classification, literature review and research agenda," Omega, Elsevier, vol. 38(6), pages 413-422, December.
    10. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2009. "On solving the Lagrangian dual of integer programs via an incremental approach," Computational Optimization and Applications, Springer, vol. 44(1), pages 117-138, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mohammad Amin Amani & Mohammad Mahdi Nasiri, 2023. "A novel cross docking system for distributing the perishable products considering preemption: a machine learning approach," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-32, July.
    2. Rupp, Johannes & Boysen, Nils & Briskorn, Dirk, 2022. "Optimizing consolidation processes in hubs: The hub-arrival-departure problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1051-1066.
    3. Gaudioso, Manlio & Monaco, Maria Flavia & Sammarra, Marcello, 2021. "A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time," Omega, Elsevier, vol. 101(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gaudioso, Manlio & Monaco, Maria Flavia & Sammarra, Marcello, 2021. "A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time," Omega, Elsevier, vol. 101(C).
    2. Coindreau, Marc-Antoine & Gallay, Olivier & Zufferey, Nicolas & Laporte, Gilbert, 2021. "Inbound and outbound flow integration for cross-docking operations," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1153-1163.
    3. Peter Bodnar & René de Koster & Kaveh Azadeh, 2017. "Scheduling Trucks in a Cross-Dock with Mixed Service Mode Dock Doors," Transportation Science, INFORMS, vol. 51(1), pages 112-131, February.
    4. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
    5. Serrano, Christian & Delorme, Xavier & Dolgui, Alexandre, 2017. "Scheduling of truck arrivals, truck departures and shop-floor operation in a cross-dock platform, based on trucks loading plans," International Journal of Production Economics, Elsevier, vol. 194(C), pages 102-112.
    6. Ladier, Anne-Laure & Alpan, Gülgün, 2016. "Cross-docking operations: Current research versus industry practice," Omega, Elsevier, vol. 62(C), pages 145-162.
    7. Fateme Heidari & Seyed Hessameddin Zegordi & Reza Tavakkoli-Moghaddam, 2018. "Modeling truck scheduling problem at a cross-dock facility through a bi-objective bi-level optimization approach," Journal of Intelligent Manufacturing, Springer, vol. 29(5), pages 1155-1170, June.
    8. Wang, Haibo & Alidaee, Bahram, 2019. "The multi-floor cross-dock door assignment problem: Rising challenges for the new trend in logistics industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 30-47.
    9. Rijal, Arpan & Bijvank, Marco & de Koster, René, 2019. "Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors," European Journal of Operational Research, Elsevier, vol. 278(3), pages 752-771.
    10. Sayed Ibrahim Sayed & Ivan Contreras & Juan A. Diaz & Dolores E. Luna, 2020. "Integrated cross-dock door assignment and truck scheduling with handling times," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(3), pages 705-727, October.
    11. M. H. Fazel Zarandi & H. Khorshidian & M. Akbarpour Shirazi, 2016. "A constraint programming model for the scheduling of JIT cross-docking systems with preemption," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 297-313, April.
    12. Gelareh, Shahin & Monemi, Rahimeh Neamatian & Semet, Frédéric & Goncalves, Gilles, 2016. "A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1144-1152.
    13. Fatemeh Faghih-Mohammadi & Mohammad Mahdi Nasiri & Dinçer Konur, 2023. "Cross-dock facility for disaster relief operations," Annals of Operations Research, Springer, vol. 322(1), pages 497-538, March.
    14. Wolff, Pascal & Emde, Simon & Pfohl, Hans-Christian, 2021. "Internal resource requirements: The better performance metric for truck scheduling?," Omega, Elsevier, vol. 103(C).
    15. Buijs, Paul & Vis, Iris F.A. & Carlo, Héctor J., 2014. "Synchronization in cross-docking networks: A research classification and framework," European Journal of Operational Research, Elsevier, vol. 239(3), pages 593-608.
    16. Xi, Xiang & Changchun, Liu & Yuan, Wang & Loo Hay, Lee, 2020. "Two-stage conflict robust optimization models for cross-dock truck scheduling problem under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    17. Ruslan Sadykov, 2012. "Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost," Annals of Operations Research, Springer, vol. 201(1), pages 423-440, December.
    18. Vanajakumari, Manoj & Sun, Haoying & Jones, Ashley & Sriskandarajah, Chelliah, 2022. "Supply chain planning: A case for Hybrid Cross-Docks," Omega, Elsevier, vol. 108(C).
    19. Konur, Dinçer & Golias, Mihalis M., 2013. "Cost-stable truck scheduling at a cross-dock facility with unknown truck arrivals: A meta-heuristic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 71-91.
    20. Fonseca, Gabriela B. & Nogueira, Thiago H. & Ravetti, Martín Gómez, 2019. "A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 139-154.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:orspec:v:40:y:2018:i:2:d:10.1007_s00291-018-0510-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.