{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:45Z","timestamp":1740122445230,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T00:00:00Z","timestamp":1546473600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10878-018-00373-y","type":"journal-article","created":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T07:05:16Z","timestamp":1546499116000},"page":"602-617","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A new leader guided optimization for the flexible job shop problem"],"prefix":"10.1007","volume":"39","author":[{"given":"Fraj","family":"Naifar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3323-7437","authenticated-orcid":false,"given":"Mariem","family":"Gzara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moalla Taicir","family":"Loukil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,3]]},"reference":[{"key":"373_CR1","first-page":"225","volume-title":"Industrial scheduling","author":"H Fisher","year":"1963","unstructured":"Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF, Thompson GL (eds) Industrial scheduling. Prentice-Hall, Upper Saddle River, pp 225\u2013251"},{"issue":"9","key":"373_CR2","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job-shop scheduling problems. Sci Direct Comput Oper Res 35(9):2892\u20132907","journal-title":"Sci Direct Comput Oper Res"},{"key":"373_CR3","doi-asserted-by":"crossref","unstructured":"Gen M, Gao J, Lin L (2009) Multistage-based genetic algorithm for flexible job shop scheduling problem. In: Intelligent and evolutionary systems. Volume 187 of the series studies in computational intelligence, pp 183\u2013196","DOI":"10.1007\/978-3-540-95978-6_13"},{"issue":"4","key":"373_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01719451","volume":"15","author":"E Hurink","year":"1994","unstructured":"Hurink E, Jurisch B, Thole M (1994) Tabu search for the job shop scheduling problem with multi-purpose machine. Oper Res Spektrum 15(4):205\u2013215","journal-title":"Oper Res Spektrum"},{"issue":"1","key":"373_CR5","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 Sched 3(1):3\u201320","journal-title":"J Sched"},{"issue":"1","key":"373_CR6","first-page":"91","volume":"14","author":"K Mesghouni","year":"2004","unstructured":"Mesghouni K, Hammadi S, Borne P (2004) Evolutionary algorithms for job-shop scheduling. Int J Appl Math Comput Sci 14(1):91\u2013103","journal-title":"Int J Appl Math Comput Sci"},{"issue":"6","key":"373_CR7","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42(6):797\u2013813","journal-title":"Manag Sci"},{"issue":"10","key":"373_CR8","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 Oper Res 35(10):3202\u20133212","journal-title":"Comput Oper Res"},{"key":"373_CR9","unstructured":"Roy B, Sussmann B (1964) Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjonctives. Note DS N\u00b0. 9bis, SEMA Montrouge"},{"key":"373_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.cie.2015.12.004","volume":"93","author":"MR Singh","year":"2016","unstructured":"Singh MR, Mahapatra SS (2016) A quantum behaved particle swarm optimization for flexible job shop scheduling. Comput Ind Eng 93:36\u201344","journal-title":"Comput Ind Eng"},{"key":"373_CR11","doi-asserted-by":"crossref","unstructured":"Thierens D (2007) Adaptive strategies for operator allocation. Volume 54 of the series studies in computational intelligence, pp 77\u201390","DOI":"10.1007\/978-3-540-69432-8_4"},{"key":"373_CR12","volume-title":"Advances in Reinforcement Learning","author":"Guojun Zhang","year":"2011","unstructured":"Zhang G, Zhu H, Zhang C (2011) Hybrid intelligent algorithm for flexible job-shop scheduling problem under uncertainty. In: Mellouk A (ed) Advances in reinforcement learning, Chapter 19, pp 361\u2013370"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-00373-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-00373-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-00373-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T16:06:24Z","timestamp":1578931584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-00373-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,3]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["373"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-00373-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,1,3]]},"assertion":[{"value":"3 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}