{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:40:24Z","timestamp":1772844024745,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3040345","type":"journal-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T01:50:16Z","timestamp":1606269016000},"page":"213318-213329","source":"Crossref","is-referenced-by-count":27,"title":["Improved Genetic Algorithm Approach Based on New Virtual Crossover Operators for Dynamic Job Shop Scheduling"],"prefix":"10.1109","volume":"8","author":[{"given":"Kaouther Ben","family":"Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5823-4641","authenticated-orcid":false,"given":"Achraf Jabeur","family":"Telmoudi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Said","family":"Gattoufi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ASET.2019.8871034"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2018.8502560"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CoDIT.2017.8102686"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s12599-019-00590-7"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2017.7969335"},{"key":"ref35","first-page":"195","article-title":"Dynamic job shop scheduling under uncertainty using genetic programming","author":"karunakaran","year":"2016","journal-title":"Proc Intell Evol Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.07.030"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1007\/s10845-013-0837-8","article-title":"A research survey: Review of AI solution strategies of job shop scheduling problem","volume":"26","author":"\u00e7ali","year":"2015","journal-title":"J Intell Manuf"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10845-015-1121-x","article-title":"Parallel bat algorithm for optimizing makespan in job shop scheduling problems","volume":"29","author":"tk","year":"2018","journal-title":"J Intell Manuf"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2009.10.004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.11.021"},{"key":"ref14","article-title":"Genetic programming with multi-tree representation for dynamic flexible job shop scheduling","volume":"11320","author":"zhang","year":"2018","journal-title":"Advances in Artificial Intelligence"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-017-0036-x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-012-0084-0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.039"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.03.011"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1504\/IJDSSS.2018.101594"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.08.058"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.01.007"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2017.12.005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.11.020"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0305-0483(90)90017-4","article-title":"Dynamic job shop scheduling: A survey of simulation research","volume":"18","author":"ramasesh","year":"1990","journal-title":"OMEGA Int J Manage Sci"},{"key":"ref29","first-page":"25","article-title":"A GRASP based approach to dynamic scheduling of parallel heat treatment furnaces in a manufacturing company","author":"baykasoglu","year":"2015","journal-title":"Proc Multidiscipl Int Sched Conf Theory Appl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-2666-9_8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2014.12.326"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2013.07.038"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3390\/sym11020165","article-title":"A new meta-heuristic algorithm for solving the flexible dynamic job-shop problem with parallel machines","volume":"11","author":"sangaiah","year":"2019","journal-title":"Symmetry"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1007\/s00500-015-1852-9","article-title":"A hybrid artificial bee colony algorithm for the job shop scheduling problem with no-wait constraint","volume":"21","author":"sundar","year":"2017","journal-title":"Soft Comput"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.117"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SSD.2018.8570456"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.42.6.797"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/07408179508936739"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2883802"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100594"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1306134"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2012.751509"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09268944.pdf?arnumber=9268944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T22:52:20Z","timestamp":1643151140000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9268944\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3040345","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}