{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T16:52:36Z","timestamp":1781974356724,"version":"3.54.5"},"reference-count":45,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2023,3,9]]},"abstract":"<jats:p>Unrelated parallel machine scheduling problem (UPMSP) with additional resources and UPMSP with learning effect have attracted some attention; however, UPMSP with additional resources and learning effect is seldom studied and meta-heuristics for UPMSP hardly possess reinforcement learning as new optimization mechanism. In this study, a shuffled frog-leaping algorithm with Q-learning (QSFLA) is presented to solve UPMSP with one additional resource and learning effect. A new solution presentation is presented. Two populations are obtained by division. A Q-learning algorithm is constructed to dynamically decide search operator and search times. It has 12 states depicted by population quality evaluation, four actions defined as search operators, a new reward function and a new action selection. Extensive experiments are conducted. Computational results demonstrate that QSFLA has promising advantages for the considered UPMSP.<\/jats:p>","DOI":"10.3233\/jifs-213473","type":"journal-article","created":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T11:34:22Z","timestamp":1672140862000},"page":"5357-5375","source":"Crossref","is-referenced-by-count":5,"title":["A shuffled frog-leaping algorithm with Q-learning for unrelated parallel machine scheduling with additional resource and learning effect"],"prefix":"10.1177","volume":"44","author":[{"given":"Tian","family":"Yi","sequence":"first","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingbo","family":"Li","sequence":"additional","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deming","family":"Lei","sequence":"additional","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-213473_ref1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","article-title":"A state-of-the-art review ofparallel-machine scheduling research","volume":"47","author":"Cheng","year":"1990","journal-title":"Euro. J. Oper. Res"},{"issue":"6","key":"10.3233\/JIFS-213473_ref2","doi-asserted-by":"crossref","first-page":"5051","DOI":"10.1109\/TCYB.2020.3026571","article-title":"A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling","volume":"52","author":"Pan","year":"2022","journal-title":"IEEE Trans. Cyber."},{"key":"10.3233\/JIFS-213473_ref3","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.ejor.2013.02.042","article-title":"Parallel machine scheduling with additional resources: notation, classification, models and solution methods","volume":"230","author":"Edis","year":"2013","journal-title":"Euro. J. Oper. Res"},{"issue":"5","key":"10.3233\/JIFS-213473_ref4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF00263292","article-title":"Minimizing mean flow-time with parallel processors and resource-constraints","volume":"24","author":"Blazewicz","year":"1987","journal-title":"Acta Infor"},{"issue":"2","key":"10.3233\/JIFS-213473_ref5","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.cie.2012.03.018","article-title":"Parallel machine scheduling with flexible resources","volume":"63","author":"Edis","year":"2012","journal-title":"Comput. Ind. Eng"},{"key":"10.3233\/JIFS-213473_ref6","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1016\/S0305-0548(02)00118-1","article-title":"Parallel machine scheduling withearliness-tardiness penalties and additional resource constraints","volume":"30","author":"Ventura","year":"2003","journal-title":"Comput. Oper. Res"},{"issue":"2016","key":"10.3233\/JIFS-213473_ref7","first-page":"28","article-title":"A two-stage adaptive fruit fly optimization algorithm for unrelated parallel machine scheduling problem with additional resource constraint","volume":"65","author":"Zheng","journal-title":"Expert Syst. Appl"},{"key":"10.3233\/JIFS-213473_ref8","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.ejor.2017.01.002","article-title":"Models and matheuristics forthe unrelated parallel machine scheduling problem with additional resources","volume":"260","author":"Fanjul-Peyro","year":"2017","journal-title":"Euro. J. Oper. Res"},{"key":"10.3233\/JIFS-213473_ref9","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1016\/j.ejor.2018.05.056","article-title":"Algorithms for the unrelated parallelmachine scheduling problem with a resource constraint","volume":"271","author":"Fleszar","year":"2018","journal-title":"Euro. J.Oper. Res"},{"issue":"5","key":"10.3233\/JIFS-213473_ref10","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1109\/TSMC.2016.2616347","article-title":"A collaborative multiobjective fruit fly optimization algorithm for the resource constrained unrelated parallel machine green scheduling problem","volume":"48","author":"Zheng","year":"2018","journal-title":"IEEE Trans. Syst,Man, Cyber: Syst"},{"key":"10.3233\/JIFS-213473_ref11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.eswa.2017.09.054","article-title":"Heuristic algorithms forthe unrelated parallel machine scheduling problem with one scarceadditional resource","volume":"93","author":"Villa","year":"2018","journal-title":"Expert Syst. Appl"},{"key":"10.3233\/JIFS-213473_ref12","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.cor.2019.07.016","article-title":"Enriched metaheuristicsfor the resource unrelated parallel machine scheduling problem","volume":"111","author":"Vallada","year":"2019","journal-title":"Comput. Oper. Res"},{"issue":"2005","key":"10.3233\/JIFS-213473_ref13","first-page":"285","article-title":"Unrelated parallel machine scheduling with second resource constraints","volume":"26","author":"Chen","journal-title":"Int. J. Adv. Manuf. Techno"},{"issue":"4","key":"10.3233\/JIFS-213473_ref14","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1007\/s10951-014-0397-6","article-title":"A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing","volume":"19","author":"Bitar","year":"2016","journal-title":"J. Sched"},{"issue":"2","key":"10.3233\/JIFS-213473_ref15","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/s10845-015-1117-6","article-title":"Design of an efficient genetical gorithm for resource-constrained unrelated parallel machinescheduling with machine eligibility restrictions","volume":"29","author":"Afzalirad","year":"2018","journal-title":"J. Intel.Manuf"},{"key":"10.3233\/JIFS-213473_ref16","doi-asserted-by":"crossref","first-page":"171533","DOI":"10.1109\/ACCESS.2019.2955975","article-title":"Optimize unrelated paralllel machine scheduling problems with multiple limited additional resources, sequence-dependent setup times and release date constraints","volume":"7","author":"Al-Harkan","year":"2019","journal-title":"IEEE Acc."},{"key":"10.3233\/JIFS-213473_ref17","first-page":"100022","article-title":"Models and an exact method for the unrelatedparallel machine scheduling problem with setups and resources","volume":"5","author":"Fanjul-Peyro","year":"2020","journal-title":"Expert Syst. Appl"},{"key":"10.3233\/JIFS-213473_ref18","doi-asserted-by":"crossref","first-page":"112959","DOI":"10.1016\/j.eswa.2019.112959","article-title":"GRASP algorithm for the unrelated parallelmachine scheduling problem with setup times and additionalresources","volume":"141","author":"Yepes-Borrero","year":"2020","journal-title":"Expert Syst. Appl"},{"issue":"1","key":"10.3233\/JIFS-213473_ref20","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.cie.2011.03.008","article-title":"Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects","volume":"61","author":"Kuo","year":"2011","journal-title":"Comput. Ind. Eng"},{"issue":"21\u201322","key":"10.3233\/JIFS-213473_ref21","doi-asserted-by":"crossref","first-page":"5231","DOI":"10.1016\/j.apm.2014.04.002","article-title":"Scheduling deteriorating jobs with alearning effect on unrelated parallel machines","volume":"38","author":"Wang","year":"2014","journal-title":"Appl. Mathe.Model"},{"issue":"7","key":"10.3233\/JIFS-213473_ref22","doi-asserted-by":"crossref","first-page":"1993","DOI":"10.1007\/s00521-015-1993-x","article-title":"Resource-dependent scheduling with deteriorating jobs and learning effects on unrelated parallel machine","volume":"27","author":"Lu","year":"2016","journal-title":"Neural Comput. Appl"},{"key":"10.3233\/JIFS-213473_ref23","doi-asserted-by":"crossref","first-page":"119428","DOI":"10.1016\/j.jclepro.2019.119428","article-title":"Scheduling of unrelated parallel machines considering sequence-related setup time, start time-dependent deterioration, position-dependeent learning and power consumption minimization","volume":"249","author":"Soleimani","year":"2020","journal-title":"J. Clean. Prod"},{"key":"10.3233\/JIFS-213473_ref24","doi-asserted-by":"crossref","first-page":"114843","DOI":"10.1016\/j.eswa.2021.114843","article-title":"A combinatorial evolutionary algorithm for unrelated parallel machine scheduling problem with sequence and machine-dependent setup times, limited worker resources and learning effect","volume":"175","author":"Zhang","year":"2021","journal-title":"Expert Syst.Appl"},{"key":"10.3233\/JIFS-213473_ref25","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1109\/TASE.2018.2862380","article-title":"Scheduling semi-conductortesting facility by using cuckoo search algorithm with reinforcement learning and surrogate modeling","volume":"16","author":"Cao","year":"2019","journal-title":"IEEE Trans. Auto. Sci. Eng"},{"key":"10.3233\/JIFS-213473_ref26","doi-asserted-by":"crossref","first-page":"106778","DOI":"10.1016\/j.cie.2020.106778","article-title":"A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem","volume":"149","author":"Chen","year":"2020","journal-title":"Comput. Ind. Eng"},{"key":"10.3233\/JIFS-213473_ref27","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TASE.2019.2945717","article-title":"A knowledge-based cuckoo search algorithm to schedule a flexible job shop with sequencing flexibility","volume":"18","author":"Cao","year":"2021","journal-title":"IEEE Trans. Auto. Sci. Eng"},{"issue":"2","key":"10.3233\/JIFS-213473_ref29","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/03052150500384759","article-title":"Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization","volume":"38","author":"Eusuff","year":"2006","journal-title":"Eng. Optim"},{"key":"10.3233\/JIFS-213473_ref30","first-page":"435","article-title":"Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm","volume":"12","author":"Rahimi-Vahed","year":"2008","journal-title":"SoftComput."},{"key":"10.3233\/JIFS-213473_ref31","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00170-010-2775-3","article-title":"An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem","volume":"52","author":"Pan","year":"2011","journal-title":"Int. J. Adv. Manuf. Techno"},{"issue":"2013","key":"10.3233\/JIFS-213473_ref32","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1007\/s00170-013-4940-y","article-title":"An effective shuffled frog-leaping algorithm for hybrid flow-shop scheduling with multiprocessor tasks","volume":"68","author":"Xu","year":"2013","journal-title":"Int. J. Adv. Manuf. Techno"},{"key":"10.3233\/JIFS-213473_ref33","doi-asserted-by":"crossref","first-page":"9333","DOI":"10.1016\/j.eswa.2015.08.025","article-title":"A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents","volume":"42","author":"Lei","year":"2015","journal-title":"Expert Syst. Appl"},{"issue":"18","key":"10.3233\/JIFS-213473_ref34","doi-asserted-by":"crossref","first-page":"9353","DOI":"10.1016\/j.amc.2012.03.018","article-title":"An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems","volume":"218","author":"Li","year":"2012","journal-title":"Appl. Mathe. Comput"},{"issue":"16","key":"10.3233\/JIFS-213473_ref35","doi-asserted-by":"crossref","first-page":"4793","DOI":"10.1080\/00207543.2015.1088970","article-title":"A shuffled frog-leaping algorithm for jobshop scheduling with outsourcing options","volume":"54","author":"Lei","year":"2016","journal-title":"Int. J. Prod. Res"},{"issue":"11","key":"10.3233\/JIFS-213473_ref36","doi-asserted-by":"crossref","first-page":"3126","DOI":"10.1080\/00207543.2016.1262082","article-title":"A shuffled frog-leaping algorithmfor flexible job shop scheduling with the consideration of energy consumption","volume":"55","author":"Lei","year":"2017","journal-title":"Int. J. Prod. Res"},{"issue":"4","key":"10.3233\/JIFS-213473_ref37","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/s10898-018-0705-3","article-title":"Parallel-batching scheduling with nonlinear processing times on asingle and unrelated parallel machines","volume":"78","author":"Kong","year":"2020","journal-title":"J. Global Optim."},{"issue":"9","key":"10.3233\/JIFS-213473_ref38","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.3390\/sym13091574","article-title":"A novel shuffled frog-leaping algorithm for unrelated parallel machine scheduling with deteriorating maintenance and setup time","volume":"13","author":"Lei","year":"2021","journal-title":"Symmetry"},{"issue":"9","key":"10.3233\/JIFS-213473_ref39","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1080\/0305215X.2019.1674295","article-title":"Solving distributed two-stage hybrid flowshopscheduling using a shuffled frog-leaping algorithm with memeplexgrouping","volume":"52","author":"Lei","year":"2020","journal-title":"Eng. Optim"},{"issue":"5","key":"10.3233\/JIFS-213473_ref40","doi-asserted-by":"crossref","first-page":"2235","DOI":"10.1007\/s40747-021-00400-2","article-title":"A cooperated shuffled frog-leaping algorithmfor distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time","volume":"7","author":"Cai","year":"2021","journal-title":"Comp. Intel. Syst."},{"issue":"2020","key":"10.3233\/JIFS-213473_ref41","first-page":"103540","article-title":"Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks","volume":"90","author":"Cai","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"18","key":"10.3233\/JIFS-213473_ref42","doi-asserted-by":"crossref","first-page":"5404","DOI":"10.1080\/00207543.2020.1780333","article-title":"A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybridflow shop","volume":"59","author":"Cai","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.3233\/JIFS-213473_ref43","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.cie.2010.04.008","article-title":"Exact and heuristic algorithms for parallel-machine scheduling with Dejong\u2019s learning effect","volume":"59","author":"Okolowski","year":"2010","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.3233\/JIFS-213473_ref44","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithms for the traveling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Ann. Oper. Res"},{"key":"10.3233\/JIFS-213473_ref45","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00992698","article-title":"Q-learning.","volume":"8","author":"Watkins","year":"1992","journal-title":"Mach. Learn"},{"key":"10.3233\/JIFS-213473_ref46","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.asoc.2015.12.035","article-title":"A robust hybrid approach based onparticle swarm optimization and genetic algorithm to minimize thetotal machine laod on unrelated parallel machines","volume":"41","author":"Salehi Mir","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"10.3233\/JIFS-213473_ref47","unstructured":"Taguchi G. , Introduction to quality engineering. Asian Productivity Organization. Tokyo: Asian Productivity Organization (1986)."}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-213473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:46Z","timestamp":1777455826000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-213473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,9]]},"references-count":45,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/jifs-213473","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,9]]}}}