{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:13:38Z","timestamp":1787012018508,"version":"3.56.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["490988677"],"award-info":[{"award-number":["490988677"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hochschule Bielefeld \u2014University of Applied Sciences and Arts"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3292548","type":"journal-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T13:17:16Z","timestamp":1688563036000},"page":"68760-68775","source":"Crossref","is-referenced-by-count":21,"title":["A Memetic Algorithm With Reinforcement Learning for Sociotechnical Production Scheduling"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6348-7897","authenticated-orcid":false,"given":"Felix","family":"Grumbach","sequence":"first","affiliation":[{"name":"Center for Applied Data Science (CfADS), Bielefeld University of Applied Sciences and Arts, Gütersloh, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2831-9948","authenticated-orcid":false,"given":"Nour Eldin Alaa","family":"Badr","sequence":"additional","affiliation":[{"name":"Center for Applied Data Science (CfADS), Bielefeld University of Applied Sciences and Arts, Gütersloh, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7576-5118","authenticated-orcid":false,"given":"Pascal","family":"Reusch","sequence":"additional","affiliation":[{"name":"Center for Applied Data Science (CfADS), Bielefeld University of Applied Sciences and Arts, Gütersloh, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4839-585X","authenticated-orcid":false,"given":"Sebastian","family":"Trojahn","sequence":"additional","affiliation":[{"name":"Department of Economics, Anhalt University of Applied Sciences, Bernburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-021-01847-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/2200000071"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86380-7_52"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ADPRL.2011.5967363"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2743240"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-60960-165-2.ch004"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2021.102416"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2022.01.366"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106781"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100664"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.2507\/IJSIMM11(3)2.201"},{"key":"ref46","article-title":"Proximal policy optimization algorithms","author":"schulman","year":"2017","journal-title":"arXiv 1707 06347"},{"key":"ref45","first-page":"1","article-title":"Stable-baselines3: Reliable reinforcement learning implementations","volume":"22","author":"raffin","year":"2021","journal-title":"J Mach Learn Res"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.3390\/math9141625"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.3390\/info10120390"},{"key":"ref42","first-page":"547","article-title":"A genetic algorithm for job-shop scheduling problems using job-based order crossover","author":"ono","year":"1999","journal-title":"Proc IEEE Int Conf Evol Comput"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1388933"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.3.383"},{"key":"ref43","author":"scherfke","year":"2022","journal-title":"SimPy Discrete Event Simulation for Python"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD53861.2021.00082"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2015.03.001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02319-4_34"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2016.7822261"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/07408178908966233"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02238804"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-020-10139-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.16.1.93"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.08.123"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1177\/16878132221086120"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3104716"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3390\/pr11010267"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3145706"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/WSC48552.2020.9383997"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-018-0537-z"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICECCME52200.2021.9590925"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/iSAI-NLP54397.2021.9678152"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.117"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-022-04612-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107044"},{"key":"ref24","first-page":"2328","article-title":"A hybrid metaheuristic algorithm with novel decoding methods for flexible flowshop scheduling considering human fatigue","author":"du","year":"2021","journal-title":"Proc IEEE Int Conf Syst Man Cybern (SMC)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/1687814018804096"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2022.05.003"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108487"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3243064.3243068"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1108\/IJICC-10-2018-0136"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106605"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84522-3_59"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2021.108151"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-019-03196-0"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10173523.pdf?arnumber=10173523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T14:23:34Z","timestamp":1691418214000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10173523\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3292548","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}