{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T03:04:47Z","timestamp":1763348687139,"version":"3.37.3"},"reference-count":52,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1016\/j.asoc.2024.112002","type":"journal-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T19:49:01Z","timestamp":1721072941000},"page":"112002","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["An incremental learning approach to dynamic parallel machine scheduling with sequence-dependent setups and machine eligibility restrictions"],"prefix":"10.1016","volume":"164","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2141-6761","authenticated-orcid":false,"given":"Donghun","family":"Lee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8890-7381","authenticated-orcid":false,"given":"In-Beom","family":"Park","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9487-2365","authenticated-orcid":false,"given":"Kwanho","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"21","key":"10.1016\/j.asoc.2024.112002_bib1","doi-asserted-by":"crossref","first-page":"4531","DOI":"10.1080\/00207540410001720745","article-title":"Parallel machine scheduling considering a job-splitting property","volume":"42","author":"Kim","year":"2004","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.asoc.2024.112002_bib2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/07408170490247296","article-title":"An industrial extension of the discrete lot-sizing and scheduling problem","volume":"36","author":"Jans","year":"2004","journal-title":"IIE Trans."},{"key":"10.1016\/j.asoc.2024.112002_bib3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.omega.2018.07.005","article-title":"Effective heuristic for large-scale unrelated parallel machines scheduling problems","volume":"83","author":"Wang","year":"2019","journal-title":"Omega"},{"issue":"9","key":"10.1016\/j.asoc.2024.112002_bib4","doi-asserted-by":"crossref","first-page":"2722","DOI":"10.1080\/00207543.2020.1740341","article-title":"A hybrid differential evolution algorithm for parallel machine scheduling of lace dyeing considering colour families, sequence-dependent setup and machine eligibility","volume":"59","author":"Li","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2024.112002_bib5","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.cie.2016.05.020","article-title":"Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions","volume":"98","author":"Afzalirad","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2024.112002_bib6","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.cor.2018.10.010","article-title":"A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server","volume":"103","author":"Bektur","year":"2019","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.asoc.2024.112002_bib7","doi-asserted-by":"crossref","first-page":"1944","DOI":"10.1109\/TCYB.2018.2817240","article-title":"Flexible job-shop rescheduling for new job insertion by using discrete Jaya algorithm","volume":"49","author":"Gao","year":"2019","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.asoc.2024.112002_bib8","doi-asserted-by":"crossref","DOI":"10.1109\/TSMC.2023.3289322","article-title":"Dynamic parallel machine scheduling with deep Q-network","author":"Liu","year":"2023","journal-title":"IEEE Trans. Syst. Man, Cybern. Syst."},{"key":"10.1016\/j.asoc.2024.112002_bib9","doi-asserted-by":"crossref","first-page":"106542","DOI":"10.1109\/ACCESS.2020.3000781","article-title":"A reinforcement learning approach to dynamic scheduling in a product-mix flexibility environment","volume":"8","author":"Shiue","year":"2020","journal-title":"IEEE Access"},{"issue":"1","key":"10.1016\/j.asoc.2024.112002_bib10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1080\/09537287.2011.572090","article-title":"Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem: integrated-circuit wire bonding","volume":"23","author":"Yang","year":"2012","journal-title":"Prod. Plan. Control."},{"issue":"4","key":"10.1016\/j.asoc.2024.112002_bib11","doi-asserted-by":"crossref","first-page":"2848","DOI":"10.1016\/j.eswa.2009.09.006","article-title":"Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic","volume":"37","author":"Ying","year":"2010","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.asoc.2024.112002_bib12","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.cie.2011.09.015","article-title":"Exact and heuristic algorithms for the aerial refueling parallel machine scheduling problem with due date-to-deadline window and ready times","volume":"62","author":"Kaplan","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2024.112002_bib13","article-title":"Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness","author":"Pickardt","year":"2010","journal-title":": Proc. - Winter Simul. Conf."},{"key":"10.1016\/j.asoc.2024.112002_bib14","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2021.101339","article-title":"Integrated scheduling and flexible maintenance in deteriorating multi-state single machine system using a reinforcement learning approach","volume":"49","author":"Wang","year":"2021","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.asoc.2024.112002_bib15","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2021.107969","article-title":"Dynamic job-shop scheduling in smart manufacturing using deep reinforcement learning","volume":"190","author":"Wang","year":"2021","journal-title":"Comput. Netw."},{"key":"10.1016\/j.asoc.2024.112002_bib16","article-title":"A DRL-based reactive scheduling policy for flexible job shops with random job arrivals","author":"Zhao","year":"2023","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.asoc.2024.112002_bib17","first-page":"25502","article-title":"Why generalization in RL is difficult: epistemic POMDPs and implicit partial observability","volume":"34","author":"Ghosh","year":"2021","journal-title":": Adv. Neural Inf. Process. Syst."},{"issue":"13","key":"10.1016\/j.asoc.2024.112002_bib18","doi-asserted-by":"crossref","first-page":"3669","DOI":"10.1080\/00207540701846236","article-title":"Data-mining-based dynamic dispatching rule selection mechanism for shop floor control systems using a support vector machine approach","volume":"47","author":"Shiue","year":"2009","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.asoc.2024.112002_bib19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.cie.2009.03.008","article-title":"Training a neural network to select dispatching rules in real time","volume":"58","author":"Mouelhi-Chibani","year":"2010","journal-title":"Comput. Ind. Eng."},{"issue":"9","key":"10.1016\/j.asoc.2024.112002_bib20","doi-asserted-by":"crossref","first-page":"2822","DOI":"10.1080\/00207543.2020.1727041","article-title":"A deep learning approach for the dynamic dispatching of unreliable machines in re-entrant production systems","volume":"58","author":"Wu","year":"2020","journal-title":"Int. J. Prod. Res."},{"issue":"11","key":"10.1016\/j.asoc.2024.112002_bib21","doi-asserted-by":"crossref","first-page":"4123","DOI":"10.3390\/su10114123","article-title":"Learning to dispatch operations with intentional delay for re-entrant multiple-chip product assembly lines","volume":"10","author":"Huh","year":"2018","journal-title":"Sustain"},{"issue":"5","key":"10.1016\/j.asoc.2024.112002_bib22","doi-asserted-by":"crossref","first-page":"5513","DOI":"10.1109\/TPAMI.2022.3213473","article-title":"Class-incremental learning: survey and performance evaluation on image classification","volume":"45","author":"Masana","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.asoc.2024.112002_bib23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s00170-008-1683-2","article-title":"A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint","volume":"43","author":"Gao","year":"2009","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"10.1016\/j.asoc.2024.112002_bib24","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/j.rcim.2006.05.006","article-title":"RFID-based wireless manufacturing for walking-worker assembly islands with fixed-position layouts","volume":"23","author":"Huang","year":"2007","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"10.1016\/j.asoc.2024.112002_bib25","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1007\/s00170-009-2203-8","article-title":"Scheduling jobs on dynamic parallel machines with sequence-dependent setup times","volume":"47","author":"Lee","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2024.112002_bib26","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.jmsy.2017.12.005","article-title":"Dynamic scheduling of parallel heat treatment furnaces: a case study at a manufacturing system","volume":"46","author":"Baykaso\u011flu","year":"2018","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.asoc.2024.112002_bib27","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1007\/s00170-006-0662-8","article-title":"Dynamic parallel machine scheduling with mean weighted tardiness objective by Q-Learning","volume":"34","author":"Zhang","year":"2007","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"10.1016\/j.asoc.2024.112002_bib28","first-page":"94","article-title":"Dynamic parallel machine scheduling with random breakdowns using the learning agent","volume":"8","author":"Yuan","year":"2016","journal-title":"Int. J. Serv. Oper. Inform."},{"key":"10.1016\/j.asoc.2024.112002_bib29","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2022.101776","article-title":"Real-time scheduling for distributed permutation flowshops with dynamic job arrivals using deep reinforcement learning","volume":"54","author":"Yang","year":"2022","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.asoc.2024.112002_bib30","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2023.102230","article-title":"A multi-agent double deep-Q-network based on state machine and event stream for flexible job shop scheduling problem","volume":"58","author":"Yuan","year":"2023","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.asoc.2024.112002_bib31","doi-asserted-by":"crossref","first-page":"101390","DOI":"10.1109\/ACCESS.2021.3097254","article-title":"Deep reinforcement learning for minimizing tardiness in parallel machine scheduling with sequence dependent family setups","volume":"9","author":"Paeng","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.asoc.2024.112002_bib32","article-title":"Attention is all you need","volume":"30","author":"Vaswani","year":"2017","journal-title":": Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2024.112002_bib33","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2022.109216","article-title":"Hyper-sausage coverage function neuron model and learning algorithm for image classification","volume":"136","author":"Ning","year":"2023","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.asoc.2024.112002_bib34","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2023.101949","article-title":"BTAD: a binary transformer deep neural network model for anomaly detection in multivariate time series data","author":"Ma","year":"2023","journal-title":"Adv. Eng. Inform."},{"issue":"3","key":"10.1016\/j.asoc.2024.112002_bib35","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1080\/08839510903549606","article-title":"Learning-based scheduling of flexible manufacturing systems using support vector machines","volume":"24","author":"Priore","year":"2010","journal-title":"Appl. Artif. Intell."},{"issue":"1","key":"10.1016\/j.asoc.2024.112002_bib36","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ijpe.2010.06.004","article-title":"Learning effective new single machine dispatching rules from optimal scheduling data","volume":"128","author":"Olafsson","year":"2010","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2024.112002_bib37","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cie.2018.09.034","article-title":"Learning-based scheduling of flexible manufacturing systems using ensemble methods","volume":"126","author":"Priore","year":"2018","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.asoc.2024.112002_bib38","article-title":"A dynamic job-shop scheduling model based on deep learning","volume":"16","author":"Tian","year":"2021","journal-title":"Adv. Prod. Eng. Manag."},{"issue":"7","key":"10.1016\/j.asoc.2024.112002_bib39","doi-asserted-by":"crossref","DOI":"10.3390\/machines10070573","article-title":"An end-to-end deep learning method for dynamic job shop scheduling problem","volume":"10","author":"Chen","year":"2022","journal-title":"Machines"},{"key":"10.1016\/j.asoc.2024.112002_bib40","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110600","article-title":"Self-growth learning based machine scheduler to minimize setup time and tardiness in OLED display semiconductor manufacturing","volume":"145","author":"Lee","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2024.112002_bib41","first-page":"3001","article-title":"An efficient domain-incremental learning approach to drive in all weather conditions","author":"Mirza","year":"2022","journal-title":": Proc. IEEE\/CVF Conf. Comput. Vis. Pattern Recognit."},{"key":"10.1016\/j.asoc.2024.112002_bib42","article-title":"A knowledge-guided end-to-end optimization framework based on reinforcement learning for flow shop scheduling","author":"Pan","year":"2023","journal-title":"IEEE Trans. Ind. Inform."},{"key":"10.1016\/j.asoc.2024.112002_bib43","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1613\/jair.898","article-title":"Accelerating reinforcement learning through implicit imitation","volume":"19","author":"Price","year":"2003","journal-title":"J. Artif. Intell. Res."},{"issue":"7","key":"10.1016\/j.asoc.2024.112002_bib44","doi-asserted-by":"crossref","first-page":"4276","DOI":"10.1109\/TII.2019.2908210","article-title":"Smart manufacturing scheduling with edge computing using multiclass deep Q network","volume":"15","author":"Lin","year":"2019","journal-title":"IEEE Trans. Ind. Inform."},{"issue":"4","key":"10.1016\/j.asoc.2024.112002_bib45","doi-asserted-by":"crossref","first-page":"3020","DOI":"10.1109\/TASE.2021.3104716","article-title":"Real-time scheduling for dynamic partial-no-wait multiobjective flexible job shop by deep reinforcement learning","volume":"19","author":"Luo","year":"2022","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"2","key":"10.1016\/j.asoc.2024.112002_bib46","article-title":"Random search for hyper-parameter optimization","volume":"13","author":"Bergstra","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.asoc.2024.112002_bib47","first-page":"1","article-title":"Adam: a method for stochastic optimization","author":"Kingma","year":"2015","journal-title":"Int. Conf. Learn. Represent."},{"issue":"1","key":"10.1016\/j.asoc.2024.112002_bib48","first-page":"11","article-title":"Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm","volume":"42","author":"Chaudhry","year":"2017","journal-title":"Sadhana - Acad. Proc. Eng. Sci."},{"key":"10.1016\/j.asoc.2024.112002_bib49","article-title":"Scalable scheduling of semiconductor packaging facilities using deep reinforcement learning","author":"Park","year":"2021","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"10.1016\/j.asoc.2024.112002_bib50","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/TSM.2015.2511798","article-title":"Fast scheduling of semiconductor manufacturing facilities using case-based reasoning","volume":"29","author":"Lim","year":"2016","journal-title":"IEEE Trans. Semicond. Manuf."},{"key":"10.1016\/j.asoc.2024.112002_bib51","article-title":"A unified approach to interpreting model predictions","volume":"30","author":"Lundberg","year":"2017","journal-title":": Adv. Neural Inf. Process. Syst."},{"issue":"5","key":"10.1016\/j.asoc.2024.112002_bib52","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TETCI.2021.3100641","article-title":"A survey on neural network interpretability","volume":"5","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494624007762?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494624007762?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,2,2]],"date-time":"2025-02-02T02:20:51Z","timestamp":1738462851000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494624007762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":52,"alternative-id":["S1568494624007762"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2024.112002","relation":{},"ISSN":["1568-4946"],"issn-type":[{"type":"print","value":"1568-4946"}],"subject":[],"published":{"date-parts":[[2024,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An incremental learning approach to dynamic parallel machine scheduling with sequence-dependent setups and machine eligibility restrictions","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2024.112002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112002"}}