{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T07:15:48Z","timestamp":1778051748545,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2018YFB1003800"],"award-info":[{"award-number":["2018YFB1003800"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972112"],"award-info":[{"award-number":["61972112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61832004"],"award-info":[{"award-number":["61832004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s00521-022-06890-6","type":"journal-article","created":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T14:05:08Z","timestamp":1642428308000},"page":"7881-7897","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Toward intelligent clothes manufacturing: a systematic method for static and dynamic task allocation by genetic optimization"],"prefix":"10.1007","volume":"34","author":[{"given":"Han","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaomeng","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shichao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanfeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,17]]},"reference":[{"key":"6890_CR1","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.sbspro.2012.09.138","volume":"62","author":"B Ak","year":"2012","unstructured":"Ak B, Koc E (2012) A guide for genetic algorithm based on parallel machine scheduling and flexible job-shop scheduling. Procedia-Social Behavi Sci 62:817\u2013823","journal-title":"Procedia-Social Behavi Sci"},{"issue":"2\u20133","key":"6890_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"C Bierwirth","year":"1995","unstructured":"Bierwirth C (1995) A generalized permutation approach to job shop scheduling with genetic algorithms. Operat-Res-Spektr 17(2\u20133):87\u201392","journal-title":"Operat-Res-Spektr"},{"key":"6890_CR3","volume-title":"Handbook on scheduling: from theory to applications","author":"J B\u0142a\u017cewicz","year":"2007","unstructured":"B\u0142a\u017cewicz J, Ecker K.H, Pesch E, Schmidt G, Weglarz J (2007) Handbook on scheduling: from theory to applications. Springer, Berlin"},{"issue":"4","key":"6890_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45(4):369\u2013375","journal-title":"Computing"},{"issue":"1","key":"6890_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ijpe.2012.03.034","volume":"141","author":"TC Chiang","year":"2013","unstructured":"Chiang TC, Lin HJ (2013) A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling. Int J Product Econo 141(1):87\u201398","journal-title":"Int J Product Econo"},{"issue":"3","key":"6890_CR6","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1016\/j.apm.2012.03.020","volume":"37","author":"Y Demir","year":"2013","unstructured":"Demir Y, \u0130\u015fleyen SK (2013) Evaluation of mathematical models for flexible job-shop scheduling problems. Appl Mathemat Modell 37(3):977\u2013988","journal-title":"Appl Mathemat Modell"},{"issue":"11","key":"6890_CR7","first-page":"2492","volume":"18","author":"R Dong","year":"2012","unstructured":"Dong R, He WP (2012) Hybrid genetic algorithm-ant colony optimization for fjsp solution. Comput Integrat Manuf Sys 18(11):2492\u20132501","journal-title":"Comput Integrat Manuf Sys"},{"issue":"3","key":"6890_CR8","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1007\/s12206-015-0242-7","volume":"29","author":"I Driss","year":"2015","unstructured":"Driss I, Mouss KN, Laggoun A (2015) A new genetic algorithm for flexible job-shop scheduling problems. J Mech Sci Tech 29(3):1273\u20131281","journal-title":"J Mech Sci Tech"},{"key":"6890_CR9","doi-asserted-by":"crossref","unstructured":"Du\u00a0Kim H, Kim JS (2003) An online scheduling algorithm for grid computing systems. In: International Conference on Grid and Cooperative Computing, pp 34\u201339. Springer","DOI":"10.1007\/978-3-540-24680-0_5"},{"key":"6890_CR10","doi-asserted-by":"crossref","unstructured":"Falkenauer E, Bouffouix S (1991) A genetic algorithm for job shop. In: ICRA, pp 824\u2013829. Citeseer","DOI":"10.1109\/ROBOT.1991.131689"},{"key":"6890_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Maths 5:287\u2013326","journal-title":"Ann Discrete Maths"},{"issue":"1","key":"6890_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10479-008-0501-4","volume":"180","author":"J Grobler","year":"2010","unstructured":"Grobler J, Engelbrecht AP, Kok S, Yadavalli S (2010) Metaheuristics for the multi-objective fjsp with sequence-dependent set-up times, auxiliary resources and machine down time. Ann Operat Res 180(1):165\u2013196","journal-title":"Ann Operat Res"},{"issue":"1","key":"6890_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0925-5273(96)00068-0","volume":"48","author":"O Holthaus","year":"1997","unstructured":"Holthaus O, Rajendran C (1997) Efficient dispatching rules for scheduling in a job shop. Int J Product Econ 48(1):87\u2013105","journal-title":"Int J Product Econ"},{"key":"6890_CR14","doi-asserted-by":"crossref","unstructured":"Izakian H, Abraham A, Snasel V (2009) Comparison of heuristics for scheduling independent tasks on heterogeneous distributed environments. In: 2009 International Joint Conference on Computational Sciences and Optimization, vol.\u00a01, pp 8\u201312. IEEE","DOI":"10.1109\/CSO.2009.487"},{"key":"6890_CR15","doi-asserted-by":"crossref","unstructured":"Li J, Pan Q, Xie S, Liang J (2010) A hybrid pareto-based tabu search for multi-objective flexible job shop scheduling problem with e\/t penalty. In: International conference in swarm intelligence, pp 620\u2013627. Springer","DOI":"10.1007\/978-3-642-13495-1_76"},{"key":"6890_CR16","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Product Econom 174:93\u2013110","journal-title":"Int J Product Econom"},{"key":"6890_CR17","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ijpe.2015.10.002","volume":"170","author":"CD Liou","year":"2015","unstructured":"Liou CD, Hsieh YC (2015) A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times. Int J Product Econom 170:258\u2013267","journal-title":"Int J Product Econom"},{"issue":"1","key":"6890_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M Mastrolilli","year":"2000","unstructured":"Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Schedul 3(1):3\u201320","journal-title":"J Schedul"},{"key":"6890_CR19","doi-asserted-by":"crossref","unstructured":"Mei Y, Nguyen S, Zhang M (2017) Evolving time-invariant dispatching rules in job shop scheduling with genetic programming. In: European Conference on Genetic Programming, pp 147\u2013163. Springer","DOI":"10.1007\/978-3-319-55696-3_10"},{"issue":"7","key":"6890_CR20","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1109\/TMC.2011.141","volume":"11","author":"S Milner","year":"2012","unstructured":"Milner S, Davis C, Zhang H, Llorca J (2012) Nature-inspired self-organization, control, and optimization in heterogeneous wireless networks. IEEE Transact Mobile Comput 11(7):1207\u20131222","journal-title":"IEEE Transact Mobile Comput"},{"issue":"15","key":"6890_CR21","doi-asserted-by":"publisher","first-page":"2941","DOI":"10.1080\/00207540410001691956","volume":"42","author":"C Moon","year":"2004","unstructured":"Moon C, Kim J, Gen M (2004) Advanced planning and scheduling based on precedence and resource constraints for e-plant chains. Int J Product Res 42(15):2941\u20132955","journal-title":"Int J Product Res"},{"key":"6890_CR22","first-page":"623","volume":"1","author":"KA Dowsland","year":"2012","unstructured":"Dowsland KA, Thompson J (2012) Simulated annealing. Handbook of Natural Comput 1:623\u20131655","journal-title":"Handbook of Natural Comput"},{"issue":"5","key":"6890_CR23","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TEVC.2012.2227326","volume":"17","author":"S Nguyen","year":"2012","unstructured":"Nguyen S, Zhang M, Johnston M, Tan KC (2012) A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem. IEEE Transact Evolution Computat 17(5):621\u2013639","journal-title":"IEEE Transact Evolution Computat"},{"issue":"2","key":"6890_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E Nowicki","year":"2005","unstructured":"Nowicki E, Smutnicki C (2005) An advanced tabu search algorithm for the job shop problem. J Schedul 8(2):145\u2013159","journal-title":"J Schedul"},{"issue":"4","key":"6890_CR25","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10845-005-0014-9","volume":"17","author":"A Okamoto","year":"2006","unstructured":"Okamoto A, Gen M, Sugawara M (2006) Integrated data structure and scheduling approach for manufacturing and transportation using hybrid genetic algorithm. J Intell Manufact 17(4):411\u2013421","journal-title":"J Intell Manufact"},{"issue":"10","key":"6890_CR26","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput & Operat Res 35(10):3202\u20133212","journal-title":"Comput & Operat Res"},{"issue":"5","key":"6890_CR27","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TEVC.2011.2161873","volume":"16","author":"BY Qu","year":"2012","unstructured":"Qu BY, Suganthan PN, Liang JJ (2012) Differential evolution with neighborhood mutation for multimodal optimization. IEEE Transact Evolut Computat 16(5):601\u2013614. https:\/\/doi.org\/10.1109\/TEVC.2011.2161873","journal-title":"IEEE Transact Evolut Computat"},{"issue":"1\u20132","key":"6890_CR28","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/s00170-004-2492-x","volume":"29","author":"R Suresh","year":"2006","unstructured":"Suresh R, Mohanasundaram K (2006) Pareto archived simulated annealing for job shop scheduling with multiple objectives. The Int J Adv Manufact Tech 29(1\u20132):184\u2013196","journal-title":"The Int J Adv Manufact Tech"},{"issue":"3","key":"6890_CR29","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","volume":"54","author":"JC Tay","year":"2008","unstructured":"Tay JC, Ho NB (2008) Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput & Ind Eng 54(3):453\u2013473","journal-title":"Comput & Ind Eng"},{"issue":"1","key":"6890_CR30","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ijpe.2004.05.005","volume":"97","author":"S Torabi","year":"2005","unstructured":"Torabi S, Karimi B, Ghomi SF (2005) The common cycle economic lot scheduling in flexible job shops: the finite horizon case. Int J Product Econom 97(1):52\u201365","journal-title":"Int J Product Econom"},{"key":"6890_CR31","doi-asserted-by":"crossref","unstructured":"\u0110urasevi\u0107 M, Jakobovi\u0107 D (2016) Comparison of solution representations for scheduling in the unrelated machines environment. In: 2016 39th International convention on information and communication technology, Electronics and Microelectronics (MIPRO), pp 1336\u20131342. IEEE","DOI":"10.1109\/MIPRO.2016.7522347"},{"issue":"5","key":"6890_CR32","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TFUZZ.2018.2879789","volume":"27","author":"B Wang","year":"2018","unstructured":"Wang B, Xie H, Xia X, Zhang X (2018) A nsga-ii algorithm hybridizing local simulated-annealing operators for a bi-criteria robust job-shop scheduling problem under scenarios. IEEE Transact Fuzzy Sys 27(5):1075\u20131084","journal-title":"IEEE Transact Fuzzy Sys"},{"issue":"4","key":"6890_CR33","doi-asserted-by":"publisher","first-page":"1520","DOI":"10.1166\/sl.2011.1676","volume":"9","author":"J Wang","year":"2011","unstructured":"Wang J (2011) Scheduling for the flexible job-shop problem based on a hybrid genetic algorithm. Sens Lett 9(4):1520\u20131525","journal-title":"Sens Lett"},{"issue":"3","key":"6890_CR34","first-page":"203","volume":"10","author":"W Wisittipanich","year":"2011","unstructured":"Wisittipanich W, Kachitvichyanukul V (2011) Differential evolution algorithm for job shop scheduling problem. Ind Eng Manage Sys 10(3):203\u2013208","journal-title":"Ind Eng Manage Sys"},{"key":"6890_CR35","doi-asserted-by":"crossref","unstructured":"Yska D, Mei Y, Zhang M (2018) Genetic programming hyper-heuristic with cooperative coevolution for dynamic flexible job shop scheduling. In: European Conference on Genetic Programming, pp 306\u2013321. Springer","DOI":"10.1007\/978-3-319-77553-1_19"},{"issue":"2","key":"6890_CR36","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/TII.2016.2605629","volume":"13","author":"H Zhang","year":"2016","unstructured":"Zhang H, Cao X, Ho JK, Chow TW (2016) Object-level video advertising: an optimization framework. IEEE Trans Ind Infor 13(2):520\u2013531","journal-title":"IEEE Trans Ind Infor"},{"issue":"3","key":"6890_CR37","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1016\/j.asoc.2012.02.024","volume":"13","author":"R Zhang","year":"2013","unstructured":"Zhang R, Song S, Wu C (2013) A hybrid differential evolution algorithm for job shop scheduling problems with expected total tardiness criterion. Appl Soft Comput 13(3):1448\u20131458","journal-title":"Appl Soft Comput"},{"issue":"1\u20134","key":"6890_CR38","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00170-013-5510-z","volume":"71","author":"M Ziaee","year":"2014","unstructured":"Ziaee M (2014) A heuristic algorithm for solving flexible job shop scheduling problem. Int J Adv Manufact Tech 71(1\u20134):519\u2013528","journal-title":"Int J Adv Manufact Tech"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-06890-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-06890-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-06890-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T13:21:29Z","timestamp":1726492889000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-06890-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,17]]},"references-count":38,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["6890"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-06890-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,17]]},"assertion":[{"value":"8 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest exits in the submission of this manuscript, and manuscript is approved by all authors for publication. I would like to declare on behalf of my co-authors that the work described was original research that has not been published previously, and not under consideration for publication elsewhere, in whole or in part. All the authors listed have approved the manuscript that is enclosed.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest statement"}}]}}