{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T04:37:01Z","timestamp":1778733421471,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:00:00Z","timestamp":1654905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:00:00Z","timestamp":1654905600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10878-022-00871-0","type":"journal-article","created":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T04:02:21Z","timestamp":1654920141000},"page":"947-969","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Particle swarm optimization based-algorithms to solve the two-machine cross-docking flow shop problem: just in time scheduling"],"prefix":"10.1007","volume":"44","author":[{"given":"Imen","family":"Hamdi","sequence":"first","affiliation":[]},{"given":"Imen","family":"Boujneh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"871_CR1","doi-asserted-by":"crossref","unstructured":"Agustina D, Lee CKM, Piplani R (2011) Cross-docking scheduling with delivery time window and temporary storage. IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Singapore, 6-9 December","DOI":"10.1109\/IEEM.2011.6117893"},{"key":"871_CR2","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1057\/palgrave.jors.2602590","volume":"60","author":"GA \u00c1lvarez-P\u00e9rez","year":"2009","unstructured":"\u00c1lvarez-P\u00e9rez GA, Gonz\u00e1lez-Velarde JL, Fowler JW (2009) Cross-docking JIT scheduling\u202f: an alternative solution approach. The Journal of the Operational Research Society 60:554\u2013564","journal-title":"The Journal of the Operational Research Society"},{"key":"871_CR3","first-page":"35","volume":"19","author":"MR Amin-nayeri","year":"2000","unstructured":"Amin-nayeri MR, Moslehi G (2000) Optimal algorithm for single machine sequencing to minimize early\/tardy cost. Esteghlal Journal of Engineering. Isfahan Univ Technol (In Persian) 19:35\u201348","journal-title":"Isfahan Univ Technol (In Persian)"},{"key":"871_CR4","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s00170-009-2429-5","volume":"49","author":"AR Boloori Arabani","year":"2010","unstructured":"Boloori Arabani AR, Fatemi Ghomi SMT, Zandieh M (2010) A multi-criteria cross-docking scheduling with just-in-time approach. Int J Adv Manuf Technol 49:741\u2013756","journal-title":"Int J Adv Manuf Technol"},{"key":"871_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ejor.2007.10.051","volume":"193","author":"F Chen","year":"2009","unstructured":"Chen F, Lee CY (2009) Minimizing the makespan in a two-machine cross-docking flow shop problem. European Journal of Operational Research 193:59\u201372","journal-title":"European Journal of Operational Research"},{"key":"871_CR6","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.eswa.2006.09.021","volume":"34","author":"JS Chen","year":"2008","unstructured":"Chen JS, Pan JCH, Lin CM (2008) A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem. Expert Syst Appl 34:570\u2013577","journal-title":"Expert Syst Appl"},{"key":"871_CR7","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.eswa.2005.12.002","volume":"32","author":"BW Cheng","year":"2007","unstructured":"Cheng BW, Chang CL (2007) A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm. Expert Syst Appl 32:415\u2013421","journal-title":"Expert Syst Appl"},{"key":"871_CR8","first-page":"54","volume":"9","author":"RL Cook","year":"2005","unstructured":"Cook RL, Gibson B, Mac Curd yD (2005) A lean approach to crossdocking. Supply Chain Management Review 9:54\u201363","journal-title":"Supply Chain Management Review"},{"key":"871_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.ijpe.2019.02.017","volume":"212","author":"MA Dulebenets","year":"2019","unstructured":"Dulebenets MA (2019) A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility. Int J Production Economics 212:236\u2013258","journal-title":"Int J Production Economics"},{"key":"871_CR10","doi-asserted-by":"crossref","unstructured":"Eberhart RC and Shi Y (2001) Tracking and Optimizing Dynamic Systems with Particle Swarms. In: Proceedings of the IEEE Congress on Evolutionary Computation, Seoul Korea, 27-30 May, pages 94\u2013100","DOI":"10.1109\/CEC.2001.934376"},{"key":"871_CR11","unstructured":"Eberhart RC, and Shi Y (2000) Comparing Inertia Weights and Constriction Factorsin Particle Swarm Optimization. In: Proceedings of the Congress on Evolutionary Computing, San Diego USA. IEEE Service Center, Piscataway NJ, pages 84\u201389"},{"key":"871_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10845-013-0860-9","volume":"27","author":"MH Fazel Zarandi","year":"2016","unstructured":"Fazel Zarandi MH, Khorshidian H, Akbarpour Shirazi M (2016) A constraint programming model for the scheduling of JIT cross-docking systems with preemption. J Intell Manuf 27:297\u2013313","journal-title":"J Intell Manuf"},{"key":"871_CR13","unstructured":"Golias MM, Ivey S, Haralambides H, Saharidis G (2009) Maximizing throughput and minimizing tardiness and earliness at a cross dock facility: A bi-objective formulation. Annual Meeting of the Transportation Research Board, Washington"},{"key":"871_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1997","unstructured":"Graham R, Lawler E, Lenstra JK, Rinnooy Kan AHG (1997) Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5:287\u2013326","journal-title":"Annals of Discrete Mathematics"},{"key":"871_CR15","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1504\/IJOR.2021.119932","volume":"42","author":"I Hamdi","year":"2021","unstructured":"Hamdi I, Hazgui Y (2021) Exact and heuristic methods to solve the two-machine cross-docking flowshop scheduling problem. Int J Oper Res 42:464\u2013477","journal-title":"Int J Oper Res"},{"key":"871_CR16","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s40305-019-00277-6","volume":"8","author":"I Hamdi","year":"2020","unstructured":"Hamdi I, Tekaya MF (2020) A genetic algorithm to minimize the makespan two-machine cross-docking flowshop problem. Journal of the Operations Research Society of China 8:457\u2013476","journal-title":"Journal of the Operations Research Society of China"},{"key":"871_CR17","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1504\/IJOR.2017.080596","volume":"28","author":"I Hamdi","year":"2017","unstructured":"Hamdi I, Loukil T (2017) The permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness. Int J Oper Res 28:70\u201386","journal-title":"Int J Oper Res"},{"key":"871_CR18","doi-asserted-by":"publisher","first-page":"299","DOI":"10.7232\/iems.2015.14.3.299","volume":"14","author":"P Hengmeechai","year":"2015","unstructured":"Hengmeechai P, Wisittipanich W (2015) A multiple-objective differential evolution for Just-in-time door assignment and truck scheduling in multi door cross-docking problems. Industrial Engineering & Management Systems 14:299\u2013311","journal-title":"Industrial Engineering & Management Systems"},{"key":"871_CR19","first-page":"35","volume":"10","author":"SE Jayanthi","year":"2017","unstructured":"Jayanthi SE, Anusuya S (2017) Minimization of Total Weighted Earliness and Tardiness using PSO for One Machine Scheduling. International Journal of Pure and Applied Mathematical Sciences 10:35\u201344","journal-title":"International Journal of Pure and Applied Mathematical Sciences"},{"key":"871_CR20","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s10845-014-1014-4","volume":"29","author":"AL Ladier","year":"2014","unstructured":"Ladier AL, Alpan G (2014) Crossdock truck scheduling with time windows\u202f: Earliness, tardiness and storage policies. J Intell Manuf 29:569\u2013583","journal-title":"J Intell Manuf"},{"key":"871_CR21","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1057\/palgrave.jors.2601812","volume":"55","author":"Y Li","year":"2004","unstructured":"Li Y, Lim A, Rodrigues B (2004) Cross-docking JIT scheduling with time windows. Int J Oper Res soc 55:1342\u20131351","journal-title":"Int J Oper Res soc"},{"key":"871_CR22","doi-asserted-by":"publisher","first-page":"3126","DOI":"10.1016\/j.cor.2005.11.021","volume":"34","author":"R M\u2019Hallah","year":"2007","unstructured":"M\u2019Hallah R (2007) Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Comput Oper Res 34:3126\u20133142","journal-title":"Comput Oper Res"},{"key":"871_CR23","first-page":"1","volume":"8","author":"A Makui","year":"2015","unstructured":"Makui A, Tokhmehchi N (2015) A Hybrid Approach for Cross-Docking Scheduling. Indian Journal of Science and Technology 8:1\u201310","journal-title":"Indian Journal of Science and Technology"},{"key":"871_CR24","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/s10845-015-1158-x","volume":"29","author":"H Mokhtari","year":"2018","unstructured":"Mokhtari H, Noroozi A (2018) An efficient chaotic based PSO for earliness\/tardiness optimization in a batch processing flow shop scheduling problem. J Intell Manuf 29:1063\u20131081","journal-title":"J Intell Manuf"},{"key":"871_CR25","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.ijpe.2009.07.003","volume":"122","author":"G Moslehi","year":"2009","unstructured":"Moslehi G, Mirzaee M, Vasei M, Modarres M, Azaronk A (2009) Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness. Int J Production Economics 122:763\u2013773","journal-title":"Int J Production Economics"},{"key":"871_CR26","first-page":"1430","volume":"167","author":"G Moslehi","year":"2005","unstructured":"Moslehi G, Vasei M, Azaron A (2005) Tavakkoli-Moghaddam, R.\u202f: Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert. Appl Math Comput 167:1430\u20131450","journal-title":"Appl Math Comput"},{"key":"871_CR27","first-page":"30","volume":"50","author":"M Napolitano","year":"2011","unstructured":"Napolitano M (2011) Crossdock fuels growth at Dots. Logistics Management 50:30\u201334","journal-title":"Logistics Management"},{"key":"871_CR28","doi-asserted-by":"crossref","unstructured":"Nearchou AC (2004) The effect of various operators on the genetic search for large scheduling problems 88:191\u2013203","DOI":"10.1016\/S0925-5273(03)00184-1"},{"key":"871_CR29","unstructured":"Ozcan E, Mohan CK (1999) Particleswarmoptimization : Surfing the waves, Proceedings of the 1999 congress on evolutionary computation, pp. 1939-1944"},{"key":"871_CR30","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0166-218X(01)00316-X","volume":"122","author":"X Qi","year":"2002","unstructured":"Qi X, Yu G, Bard JF (2002) Single machine scheduling with assignable due dates. Discrete Applied Mathematics 122:211\u2013233","journal-title":"Discrete Applied Mathematics"},{"key":"871_CR31","first-page":"371","volume":"10","author":"GP Roston","year":"1996","unstructured":"Roston GP, Sturges RH (1996) GeneticAlgorithmsynthesis of four-bar mechanisms. Artificial Intelligence for Engineering. Design. Analysis and Manufacturing 10:371\u2013390","journal-title":"Design. Analysis and Manufacturing"},{"key":"871_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-017-0486-y","volume":"40","author":"S Schwerdfeger","year":"2018","unstructured":"Schwerdfeger S, Boysen N, Briskorn D (2018) Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal. OR Spectrum 40:1\u201321","journal-title":"OR Spectrum"},{"key":"871_CR33","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ejor.2011.07.053","volume":"216","author":"D Shabtay","year":"2012","unstructured":"Shabtay D (2012) The just-in-time scheduling problem in a flow-shop scheduling system. European Journal of Operational Research 216:521\u2013532","journal-title":"European Journal of Operational Research"},{"key":"871_CR34","unstructured":"Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization, Evolutionary Computation, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)"},{"key":"871_CR35","unstructured":"Shi Y, Eberhart R (1998) A modified particle swarm optimizer. Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence, The 1998 IEEE International Conference"},{"key":"871_CR36","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177:1930\u20131947","journal-title":"European Journal of Operational Research"},{"key":"871_CR37","doi-asserted-by":"crossref","unstructured":"Tasgetiren T, Sakarya MF, Sevkli M, Liang YC, Cencylmaz G (2004) Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceeding of the 2004 congress on evolutionary computation, Portland, 1412\u20131419","DOI":"10.1109\/CEC.2004.1331062"},{"key":"871_CR38","first-page":"388","volume":"174","author":"R Tavakkoli-Moghaddam","year":"2006","unstructured":"Tavakkoli-Moghaddam R, Moslehi G, Vasei M, Azaron A (2006) A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert. Appl Math Comput 174:388\u2013408","journal-title":"Appl Math Comput"},{"key":"871_CR39","first-page":"1","volume":"9","author":"N Tyagi","year":"2016","unstructured":"Tyagi N, Tripathi RP, Chandramouli AB (2016) Single Machine Scheduling Model with Total Tardiness Problem. Indian Journal of Science and Technology 9:1\u201314","journal-title":"Indian Journal of Science and Technology"},{"key":"871_CR40","doi-asserted-by":"publisher","first-page":"341","DOI":"10.3233\/FI-2010-370","volume":"105","author":"F Van den Bergh","year":"2010","unstructured":"Van den Bergh F, Engelbrecht A (2010) A Convergence Proof for the Particle Swarm Optimiser. Fundamenta Informaticae 105:341\u2013374","journal-title":"Fundamenta Informaticae"},{"key":"871_CR41","unstructured":"Van den Bergh F (2001) An analysis of particle swarm optimizers. Ph.D.dissertation, University of Pretoria, Pretoria, South Africa"},{"key":"871_CR42","doi-asserted-by":"crossref","unstructured":"Van den Bergh F and Engelbrecht AP (2001) Training Product Unit Networks using Cooperative Particle Swarm Optimisers. In: Proceedings of the International Joint Conference on Neural Networks (IJCNN), Washington DC, USA, pages 126\u2013132","DOI":"10.1109\/IJCNN.2001.939004"},{"key":"871_CR43","first-page":"231","volume":"7","author":"K Vinoj","year":"2016","unstructured":"Vinoj K, Jose T (2016) Flow shop scheduling using genetic algorithm. International journal of latest trends in engineering and technology 7:231\u2013239","journal-title":"International journal of latest trends in engineering and technology"},{"key":"871_CR44","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1504\/IJISE.2020.107778","volume":"35","author":"W Wisittipanich","year":"2020","unstructured":"Wisittipanich W, Irohara T, Hengmeecha P (2020) Particle swarm optimisation for truck scheduling problem in cross docking network. International Journal of Industrial and Systems Engineering 35:345\u2013371","journal-title":"International Journal of Industrial and Systems Engineering"},{"key":"871_CR45","first-page":"44","volume":"53","author":"CE Witt","year":"1998","unstructured":"Witt CE (1998) Crossdocking: concepts demand choice. Material Handling Engineering 53:44\u20139","journal-title":"Material Handling Engineering"},{"key":"871_CR46","unstructured":"Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, 2nd ed"},{"key":"871_CR47","doi-asserted-by":"publisher","first-page":"5365","DOI":"10.1080\/00207543.2018.1464678","volume":"56","author":"Y Ye","year":"2018","unstructured":"Ye Y, Li J, Li K, Fu H (2018) Cross-docking truck scheduling with product unloading\/loading constraints based on an improved particle swarm optimisation algorithm. Int J Prod Res 56:5365\u20135385","journal-title":"Int J Prod Res"},{"key":"871_CR48","doi-asserted-by":"crossref","unstructured":"Yea Y, Li JF, Fung RYK, Li K, Fu H (2018) Optimizing truck scheduling in a cross-docking system with preemption and unloading\/loading sequence constraint. 27-29 March 2018 IEEE 15th International Conference on Networking, Sensing and Control (ICNSC), Zhuhai, China","DOI":"10.1109\/ICNSC.2018.8361332"},{"key":"871_CR49","doi-asserted-by":"publisher","first-page":"249","DOI":"10.14257\/ijhit.2015.8.11.21","volume":"8","author":"H Zhao","year":"2015","unstructured":"Zhao H, Chen L (2015) Hybrid Particle Swarm Optimization for Two-stage Cross Docking Scheduling. International Journal of Hybrid Information Technology 8:249\u2013266","journal-title":"International Journal of Hybrid Information Technology"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00871-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00871-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00871-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:15:12Z","timestamp":1660371312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00871-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,11]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["871"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00871-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,11]]},"assertion":[{"value":"24 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}