IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i2d10.1007_s10878-022-00871-0.html
   My bibliography  Save this article

Particle swarm optimization based-algorithms to solve the two-machine cross-docking flow shop problem: just in time scheduling

Author

Listed:
  • Imen Hamdi

    (High Institute of Transport and Logistics, University of Sousse
    MODILS lab, Faculty of Economics and Management, University of Sfax)

  • Imen Boujneh

    (High Institute of Transport and Logistics, University of Sousse)

Abstract

Cross-docking is an innovative logistical strategy which provides less inventory holding costs, less transportation costs and fast customer deliveries without storage in between or less than 24 hours. In this paper, we address the two-machine cross-docking scheduling problem within a Just-In-Time (JIT) context. This latter requires the punctuality and exactness of product deliveries. To satisfy this target, we aim to minimize the total earliness and tardiness, then early or tardy deliveries are discouraged. This study presents a great contribution in solving such NP-hard problem while applying different versions of the PSO (Particle Swarm Optimization) algorithm. One of them is hybridized with the Genetic Algorithm (GA). This latter is then shown to be the best one over computational experiments using different sized instances and by determining a percentage deviation from a developed lower bound.

Suggested Citation

  • Imen Hamdi & Imen Boujneh, 2022. "Particle swarm optimization based-algorithms to solve the two-machine cross-docking flow shop problem: just in time scheduling," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 947-969, September.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:2:d:10.1007_s10878-022-00871-0
    DOI: 10.1007/s10878-022-00871-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-022-00871-0
    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/s10878-022-00871-0?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. Moslehi, G. & Mirzaee, M. & Vasei, M. & Modarres, M. & Azaron, A., 2009. "Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness," International Journal of Production Economics, Elsevier, vol. 122(2), pages 763-773, December.
    3. Dulebenets, Maxim A., 2019. "A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility," International Journal of Production Economics, Elsevier, vol. 212(C), pages 236-258.
    4. Warisa Wisittipanich & Takashi Irohara & Piya Hengmeechai, 2020. "Particle swarm optimisation for truck scheduling problem in cross docking network," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 35(3), pages 345-371.
    5. Y Li & A Lim & B Rodrigues, 2004. "Crossdocking—JIT scheduling with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1342-1351, December.
    6. Yan Ye & Jingfeng Li & Kaibin Li & Hui Fu, 2018. "Cross-docking truck scheduling with product unloading/loading constraints based on an improved particle swarm optimisation algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 56(16), pages 5365-5385, August.
    7. Stefan Schwerdfeger & Nils Boysen & Dirk Briskorn, 2018. "Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 1-21, January.
    8. Nearchou, A.C.Andreas C., 2004. "The effect of various operators on the genetic search for large scheduling problems," International Journal of Production Economics, Elsevier, vol. 88(2), pages 191-203, March.
    9. Tasgetiren, M. Fatih & Liang, Yun-Chia & Sevkli, Mehmet & Gencyilmaz, Gunes, 2007. "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1930-1947, March.
    10. Shabtay, Dvir, 2012. "The just-in-time scheduling problem in a flow-shop scheduling system," European Journal of Operational Research, Elsevier, vol. 216(3), pages 521-532.
    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. Imen Hamdi & Taïcir Loukil, 2017. "The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 28(1), pages 70-86.
    Full references (including those not matched with items on IDEAS)

    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. Oluwatosin Theophilus & Maxim A. Dulebenets & Junayed Pasha & Olumide F. Abioye & Masoud Kavoosi, 2019. "Truck Scheduling at Cross-Docking Terminals: A Follow-Up State-Of-The-Art Review," Sustainability, MDPI, vol. 11(19), pages 1-23, September.
    2. 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.
    3. Bingtao Quan & Sujian Li & Kuo-Jui Wu, 2022. "Optimizing the Vehicle Scheduling Problem for Just-in-Time Delivery Considering Carbon Emissions and Atmospheric Particulate Matter," Sustainability, MDPI, vol. 14(10), pages 1-19, May.
    4. 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.
    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. Dulebenets, Maxim A., 2019. "A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility," International Journal of Production Economics, Elsevier, vol. 212(C), pages 236-258.
    7. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    8. Saeid Rezaei & Amirsaman Kheirkhah, 2018. "A comprehensive approach in designing a sustainable closed-loop supply chain network using cross-docking operations," Computational and Mathematical Organization Theory, Springer, vol. 24(1), pages 51-98, March.
    9. 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.
    10. Zhang, Yi & Li, Xiaoping & Wang, Qian, 2009. "Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization," European Journal of Operational Research, Elsevier, vol. 196(3), pages 869-876, August.
    11. 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).
    12. Mehravaran, Yasaman & Logendran, Rasaratnam, 2012. "Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 135(2), pages 953-963.
    13. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    14. Albert Corominas & Alberto García-Villoria & Rafael Pastor, 2013. "Metaheuristic algorithms hybridised with variable neighbourhood search for solving the response time variability problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 296-312, July.
    15. L. Michel & A. Shvartsman & E. Sonderegger & P. Hentenryck, 2011. "Optimal deployment of eventually-serializable data services," Annals of Operations Research, Springer, vol. 184(1), pages 273-294, April.
    16. Jacomine Grobler & Andries Engelbrecht & Schalk Kok & Sarma Yadavalli, 2010. "Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time," Annals of Operations Research, Springer, vol. 180(1), pages 165-196, November.
    17. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    18. Quang Chieu Ta & Jean-Charles Billaut & Jean-Louis Bouquard, 2018. "Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 617-628, March.
    19. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    20. Shi, Wen & Liu, Zhixue & Shang, Jennifer & Cui, Yujia, 2013. "Multi-criteria robust design of a JIT-based cross-docking distribution center for an auto parts supply chain," European Journal of Operational Research, Elsevier, vol. 229(3), pages 695-706.

    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:jcomop:v:44:y:2022:i:2:d:10.1007_s10878-022-00871-0. 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.