{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T05:47:00Z","timestamp":1771048020142,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST109-2221-E-027-073"],"award-info":[{"award-number":["MOST109-2221-E-027-073"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST109-2410-H-182-009MY3"],"award-info":[{"award-number":["MOST109-2410-H-182-009MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005795","name":"Chang Gung Memorial Hospital, Linkou","doi-asserted-by":"publisher","award":["BMRPA19"],"award-info":[{"award-number":["BMRPA19"]}],"id":[{"id":"10.13039\/501100005795","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s12652-022-04392-w","type":"journal-article","created":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T09:03:27Z","timestamp":1663578207000},"page":"11123-11138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Reinforcement learning iterated greedy algorithm for distributed assembly permutation flowshop scheduling problems"],"prefix":"10.1007","volume":"14","author":[{"given":"Kuo-Ching","family":"Ying","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1343-0838","authenticated-orcid":false,"given":"Shih-Wei","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,19]]},"reference":[{"key":"4392_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.cor.2013.11.017","volume":"52","author":"J Behnamian","year":"2014","unstructured":"Behnamian J (2014) Decomposition based hybrid VNS\u2013TS algorithm for distributed parallel factories scheduling with virtual corporation. Comput Oper Res 52:181\u2013191","journal-title":"Comput Oper Res"},{"key":"4392_CR2","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.eswa.2005.04.009","volume":"29","author":"FTS Chan","year":"2005","unstructured":"Chan FTS, S.H. Chung SH, and P.L.Y. Chan. (2005) An Adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert Syst Appl 29:364\u2013371","journal-title":"Expert Syst Appl"},{"key":"4392_CR3","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1080\/00207540500319229","volume":"44","author":"FTS Chan","year":"2006","unstructured":"Chan FTS, Chung SH, Chan PLY (2006) Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems. Int J Prod Res 44:523\u2013543","journal-title":"Int J Prod Res"},{"key":"4392_CR4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1080\/00207543.2018.1457812","volume":"57","author":"CY Cheng","year":"2019","unstructured":"Cheng CY, Ying KC, Chen HH, Lu HS (2019) Minimizing makespan in distributed mixed no-idle flowshops. Int J Prod Res 57:48\u201360","journal-title":"Int J Prod Res"},{"key":"4392_CR5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ejor.2009.01.008","volume":"200","author":"L De Giovanni","year":"2010","unstructured":"De Giovanni L, Pezzella F (2010) An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur J Oper Res 200:395\u2013408","journal-title":"Eur J Oper Res"},{"key":"4392_CR6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.033","volume":"273","author":"JM Framinan","year":"2019","unstructured":"Framinan JM, Perez-Gonzalez P, Fernandez-Viagas V (2019) Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures. Eur J Oper Res 273:401\u2013417","journal-title":"Eur J Oper Res"},{"key":"4392_CR7","volume":"1486","author":"F Guo","year":"2020","unstructured":"Guo F, Li Y, Liu A, an Z. Liu, Z. (2020) A reinforcement learning method to scheduling problem of steel production process. J Phys Conf Ser 1486:072035","journal-title":"J Phys Conf Ser"},{"key":"4392_CR8","doi-asserted-by":"crossref","first-page":"5292","DOI":"10.1080\/00207543.2013.807955","volume":"51","author":"S Hatami","year":"2013","unstructured":"Hatami S, Ruiz R, Andr\u00e9s-Romano C (2013) The distributed assembly permutation flowshop scheduling problem. Int J Prod Res 51:5292\u20135308","journal-title":"Int J Prod Res"},{"key":"4392_CR9","first-page":"139","volume":"51","author":"S Hatami","year":"2014","unstructured":"Hatami S, Ruiz R, Romano CA (2014) \u201cTwo simple constructive algorithms for the distributed assembly permutation flowshop scheduling problem\u201d, managing complexity. Int J Prod Res 51:139\u201345","journal-title":"Int J Prod Res"},{"key":"4392_CR10","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.ijpe.2015.07.027","volume":"169","author":"S Hatami","year":"2015","unstructured":"Hatami S, Ruiz R, Andr\u00e9s-Romano C (2015) Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times. Int J Prod Econ 169:76\u201388","journal-title":"Int J Prod Econ"},{"key":"4392_CR11","volume":"152","author":"YY Huang","year":"2021","unstructured":"Huang YY, Pan QK, Huang JP, Suganthan PN, Gao L (2021) An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem. Comput Ind Eng 152:107021","journal-title":"Comput Ind Eng"},{"key":"4392_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1177\/1063293X02010001054","volume":"10","author":"HZ Jia","year":"2002","unstructured":"Jia HZ, Fuh JYH, Nee AYC, Zhang YF (2002) 2002, \u201cWeb-based multi-functional scheduling system for a distributed manufacturing environment.\u201d Concurr Eng 10:27\u201339","journal-title":"Concurr Eng"},{"key":"4392_CR13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.cie.2007.06.024","volume":"53","author":"HZ Jia","year":"2007","unstructured":"Jia HZ, Fuh JYH, Nee AYC, Zhang YF (2007) Integration of genetic algorithm and gantt chart for job shop scheduling in distributed manufacturing systems. Comput Ind Eng 53:313\u2013320","journal-title":"Comput Ind Eng"},{"key":"4392_CR14","volume":"96","author":"XL Jing","year":"2020","unstructured":"Jing XL, Pan QK, Gao L, Wang YL (2020) An effective iterated greedy algorithm for the distributed permutation flowshop scheduling with due windows. Appl Soft Comput 96:106629","journal-title":"Appl Soft Comput"},{"key":"4392_CR15","first-page":"6697060","volume":"2021","author":"HAE Khalifa","year":"2021","unstructured":"Khalifa HAE, Alodhaibi SS, Kumar P (2021) Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates. Adv Fuzzy Syst 2021:6697060","journal-title":"Adv Fuzzy Syst"},{"key":"4392_CR16","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s11740-017-0716-9","volume":"11","author":"M Komaki","year":"2017","unstructured":"Komaki M, Malakooti B (2017) General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem. Prod Eng Res Devel 11:315\u2013329","journal-title":"Prod Eng Res Devel"},{"key":"4392_CR17","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1080\/0305215X.2019.1674295","volume":"52","author":"D Lei","year":"2020","unstructured":"Lei D, Wang T (2020) Solving Distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping. Eng Optim 52:1461\u20131474","journal-title":"Eng Optim"},{"key":"4392_CR18","doi-asserted-by":"crossref","first-page":"7232","DOI":"10.1080\/00207543.2020.1836422","volume":"59","author":"D Lei","year":"2021","unstructured":"Lei D, Su B, Li M (2021) Cooperated teaching-learning-based optimisation for distributed two-stage assembly flow shop scheduling. Int J Prod Res 59:7232\u20137245","journal-title":"Int J Prod Res"},{"key":"4392_CR19","first-page":"1","volume":"2019","author":"W Li","year":"2019","unstructured":"Li W, Li J, Gao K, Han Y, Niu B, Liu Z, Sun Q (2019) Solving robotic distributed flowshop problem using an improved iterated greedy algorithm. Int J Adv Rob Syst 2019:1\u201316","journal-title":"Int J Adv Rob Syst"},{"key":"4392_CR20","volume":"100","author":"H Li","year":"2020","unstructured":"Li H, Li X, Gao L (2020a) A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem. Appl Soft Comput 100:106946","journal-title":"Appl Soft Comput"},{"key":"4392_CR21","volume":"147","author":"Y Li","year":"2020","unstructured":"Li Y, Li X, Gao L, Meng L (2020b) An Improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times. Comput Ind Eng 147:106638","journal-title":"Comput Ind Eng"},{"key":"4392_CR22","first-page":"1","volume":"59","author":"Y Li","year":"2020","unstructured":"Li Y, Li X, Gao L, Zhang B, Pan QK, Tasgetiren MF, Meng L (2020c) A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Int J Prod Res 59:1\u201320","journal-title":"Int J Prod Res"},{"key":"4392_CR23","doi-asserted-by":"crossref","unstructured":"Li X., X. Zhang, M. Yin, and J. Wang. 2015, \u201cA Genetic Algorithm for the Distributed Assembly Permutation Flowshop Scheduling Problem,\u201d In: 2015 IEEE Congress on Evolutionary Computation, pp. 3096\u20133101.","DOI":"10.1109\/CEC.2015.7257275"},{"key":"4392_CR24","first-page":"1","volume":"2018","author":"WC Lin","year":"2018","unstructured":"Lin WC (2018) \u201cMinimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect. Discret Dyn Nat Soc 2018:1\u201315","journal-title":"Discret Dyn Nat Soc"},{"key":"4392_CR25","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.cie.2016.05.005","volume":"97","author":"J Lin","year":"2016","unstructured":"Lin J, S. Zhang S. (2016) An Effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problem. Comput Ind Eng 97:128\u2013136","journal-title":"Comput Ind Eng"},{"key":"4392_CR26","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1016\/j.cor.2011.08.009","volume":"40","author":"SW Lin","year":"2013","unstructured":"Lin SW, Ying KC (2013) Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm. Comput Oper Res 40:1625\u20131647","journal-title":"Comput Oper Res"},{"key":"4392_CR27","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1080\/00207543.2014.942011","volume":"53","author":"SW Lin","year":"2015","unstructured":"Lin SW, Ying KC (2015) A multi-point simulated annealing heuristic for solving multiple-objective unrelated parallel machine scheduling problem. Int J Prod Res 53:1065\u20131076","journal-title":"Int J Prod Res"},{"key":"4392_CR28","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.cie.2016.07.027","volume":"99","author":"SW Lin","year":"2016","unstructured":"Lin SW, Ying KC (2016) Minimizing makespan for solving the distributed no-wait flowshop scheduling problem. Comput Ind Eng 99:202\u2013209","journal-title":"Comput Ind Eng"},{"key":"4392_CR29","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.ijpe.2011.01.004","volume":"130","author":"SW Lin","year":"2011","unstructured":"Lin SW, Ying KC, Lu CC, Gupta JND (2011) Applying multi-start simulated annealing to schedule a flowline manufacturing cell with sequence dependent family setup times. Int J Prod Econ 130:246\u2013254","journal-title":"Int J Prod Econ"},{"key":"4392_CR30","doi-asserted-by":"crossref","first-page":"5029","DOI":"10.1080\/00207543.2013.790571","volume":"51","author":"SW Lin","year":"2013","unstructured":"Lin SW, Ying KC, Huang CY (2013) Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm. Int J Prod Res 51:5029\u20135038","journal-title":"Int J Prod Res"},{"key":"4392_CR31","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.swevo.2017.04.007","volume":"36","author":"J Lin","year":"2017","unstructured":"Lin J, Wang ZJ, Li X (2017) A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem. Swarm Evol Comput 36:124\u2013135","journal-title":"Swarm Evol Comput"},{"key":"4392_CR32","volume":"169","author":"J Mao","year":"2021","unstructured":"Mao J, Pan Q, Miao Z, Gao L (2021) An Effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance. Expert Syst Appl 169:114495","journal-title":"Expert Syst Appl"},{"key":"4392_CR33","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/PECon.2012.6450268","volume-title":"2012 IEEE International Conference on Power and Energy (PECon)","author":"SD Maqbool","year":"2012","unstructured":"Maqbool SD, Ahamed TI, Ali SQ, Pazheri FR, Malik NH (2012) Comparison of pursuit and \u03b5-Greedy algorithm for load scheduling under real time pricing. 2012 IEEE International Conference on Power and Energy (PECon). Kota Kinabalu, Malaysia, pp 515\u2013519"},{"key":"4392_CR34","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100804","volume":"60","author":"T Meng","year":"2021","unstructured":"Meng T, Pan QK (2021) A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time. Swarm Evol Comput 60:100804","journal-title":"Swarm Evol Comput"},{"key":"4392_CR35","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.104894","volume":"184","author":"T Meng","year":"2019","unstructured":"Meng T, Pan QK, Wang L (2019) A Distributed permutation flowshop scheduling problem with the customer order constraint. Knowl-Based Syst 184:104894","journal-title":"Knowl-Based Syst"},{"key":"4392_CR36","doi-asserted-by":"crossref","first-page":"7754","DOI":"10.1016\/j.eswa.2014.06.023","volume":"41","author":"B Naderi","year":"2014","unstructured":"Naderi B, Azab A (2014) Modeling and heuristics for scheduling of distributed job shops. Expert Syst Appl 41:7754\u20137763","journal-title":"Expert Syst Appl"},{"key":"4392_CR37","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi B, Ruiz R (2010) The distributed permutation flowshop scheduling problem. Comput Oper Res 37:754\u2013768","journal-title":"Comput Oper Res"},{"key":"4392_CR38","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz Jr","year":"1983","unstructured":"Nawaz M Jr, Enscore E, Ham I (1983) A Heuristic algorithm for the M-machine, N-job flow-shop sequencing problem. Omega 11:91\u201395","journal-title":"Omega"},{"key":"4392_CR39","volume":"81","author":"QK Pan","year":"2019","unstructured":"Pan QK, Gao L, Li XY, Jose FM (2019) Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem. Appl Soft Comput 81:105492","journal-title":"Appl Soft Comput"},{"key":"4392_CR40","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3041494","author":"QK Pan","year":"2022","unstructured":"Pan QK, Gao L, Wang L (2022) An effective cooperative co-evolutionary algorithm for distributed flowshop group scheduling problems. IEEE Trans Cybern Forthcom. https:\/\/doi.org\/10.1109\/TCYB.2020.3041494","journal-title":"IEEE Trans Cybern Forthcom"},{"key":"4392_CR41","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.jmsy.2021.08.014","volume":"61","author":"P Pourhejazy","year":"2021","unstructured":"Pourhejazy P, Cheng CY, Ying KC, Lin SY (2021) Supply chain-oriented two-stage assembly flowshops with sequence-dependent setup times. J Manuf Syst 61:139\u2013154","journal-title":"J Manuf Syst"},{"key":"4392_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-022-04537-2","author":"P Pourhejazy","year":"2022","unstructured":"Pourhejazy P, Cheng CY, Ying KC, Nam NH (2022) Meta-lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed-setups. Ann Oper Rese Forthc. https:\/\/doi.org\/10.1007\/s10479-022-04537-2","journal-title":"Ann Oper Rese Forthc"},{"key":"4392_CR43","doi-asserted-by":"crossref","unstructured":"Renna P. 2012, Production and Manufacturing System Management: Coordination Approaches and Multi-site Planning. IGI Global.","DOI":"10.4018\/978-1-4666-2098-8"},{"key":"4392_CR44","doi-asserted-by":"crossref","first-page":"3802","DOI":"10.1080\/00207543.2018.1504248","volume":"57","author":"DA Rossit","year":"2019","unstructured":"Rossit DA, Tohm\u00e9 F, Frutos M (2019) \u201cIndustry 4.0: smart scheduling. Int J Prod Res 57:3802\u20133813","journal-title":"Int J Prod Res"},{"key":"4392_CR45","volume":"4","author":"K Vanchinathan","year":"2021","unstructured":"Vanchinathan K, Selvaganesan N (2021) Adaptive fractional order PID controller tuning for brushless DC motor using artificial bee colony algorithm. Results Control Optim 4:100032","journal-title":"Results Control Optim"},{"key":"4392_CR46","doi-asserted-by":"crossref","first-page":"1850123","DOI":"10.1142\/S0218126618501232","volume":"27","author":"K Vanchinathan","year":"2018","unstructured":"Vanchinathan K, Valluvan KR (2018) \u201cA metaheuristic optimization approach for tuning of fractional-order PID controller for speed control of sensorless BLDC motor. J Circ Sys Comput 27:1850123","journal-title":"J Circ Sys Comput"},{"key":"4392_CR47","volume":"31","author":"K Vanchinathan","year":"2021","unstructured":"Vanchinathan K, Valluvan KTR, Gnanavel C, Gokul C, Albert JR (2021) An improved incipient whale optimization algorithm based robust fault detection and diagnosis for sensorless brushless dc motor drive under external disturbances. Int Trans Electr Energy Syst 31:e13251","journal-title":"Int Trans Electr Energy Syst"},{"key":"4392_CR48","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/TSMC.2015.2416127","volume":"46","author":"SY Wang","year":"2016","unstructured":"Wang SY, Wang L (2016) An Estimation of distribution algorithm-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem. IEEE Trans Syst Man Cybern Syst 46:139\u2013149","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"4392_CR49","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1057\/jors.2015.50","volume":"67","author":"K Wang","year":"2016","unstructured":"Wang K, Huang Y, Qin H (2016) A Fuzzy Logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown. J Oper Res Soc 67:68\u201382","journal-title":"J Oper Res Soc"},{"key":"4392_CR50","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.swevo.2018.01.012","volume":"41","author":"CC Wu","year":"2018","unstructured":"Wu CC, Chen JY, Lin WC, Lai K, Liu SC, Yu PW (2018) A two-stage three-machine assembly flow shop scheduling with learning consideration to minimize the flowtime by six hybrids of particle swarm optimization. Swarm Evol Comput 41:97\u2013110","journal-title":"Swarm Evol Comput"},{"key":"4392_CR51","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.cie.2019.02.047","volume":"130","author":"CC Wu","year":"2019","unstructured":"Wu CC, Chen JY, Lin WC, Lai K, Bai D, Lai SY (2019) A two-stage three-machine assembly scheduling flowshop problem with both two-agent and learning phenomenon. Comput Ind Eng 130:485\u2013499","journal-title":"Comput Ind Eng"},{"key":"4392_CR52","doi-asserted-by":"crossref","first-page":"4053","DOI":"10.1080\/00207543.2020.1757174","volume":"59","author":"S Yang","year":"2021","unstructured":"Yang S, Xu Z (2021) The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery. Int J Prod Res 59:4053\u20134071","journal-title":"Int J Prod Res"},{"key":"4392_CR53","doi-asserted-by":"crossref","first-page":"15694","DOI":"10.1109\/ACCESS.2017.2732738","volume":"5","author":"KC Ying","year":"2017","unstructured":"Ying KC, Lin SW (2017) Minimizing makespan in distributed blocking flowshops using hybrid ierated greedy algorithms. IEEE Access 5:15694\u201315705","journal-title":"IEEE Access"},{"key":"4392_CR54","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.eswa.2017.09.032","volume":"92","author":"KC Ying","year":"2018","unstructured":"Ying KC, Lin SW (2018) Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert Syst Appl 92:132\u2013141","journal-title":"Expert Syst Appl"},{"key":"4392_CR55","volume":"146","author":"KC Ying","year":"2020","unstructured":"Ying KC, Lin SW (2020) Solving no-wait job-shop scheduling problems using a multi-start simulated annealing with bi-directional shift timetabling algorithm. Comput Ind Eng 146:106615","journal-title":"Comput Ind Eng"},{"key":"4392_CR56","volume":"169","author":"KC Ying","year":"2022","unstructured":"Ying KC, Lin SW (2022) Minimizing total completion time in no-wait jobshops using a backtracking multi-start simulated annealing algorithm. Comput Ind Eng 169:108238","journal-title":"Comput Ind Eng"},{"key":"4392_CR57","doi-asserted-by":"crossref","first-page":"1795","DOI":"10.1007\/s10845-010-0483-3","volume":"23","author":"KC Ying","year":"2012","unstructured":"Ying KC, Lee ZJ, Lin SW (2012) Makespan minimization for scheduling unrelated parallel machines with setup times. J Intell Manuf 23:1795\u20131803","journal-title":"J Intell Manuf"},{"key":"4392_CR58","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.cie.2017.06.025","volume":"110","author":"KC Ying","year":"2017","unstructured":"Ying KC, Lin SW, Cheng CY, He CD (2017) Iterated Reference Greedy Algorithm for Solving Distributed No-idle Permutation Flowshop Scheduling Problems. Comput Ind Eng 110:413\u2013423","journal-title":"Comput Ind Eng"},{"key":"4392_CR59","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1842938","author":"KC Ying","year":"2022","unstructured":"Ying KC, Pourhejazy P, Cheng CY, Syu RS (2022) \u201cSupply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times. Int J Prod Res Forthc. https:\/\/doi.org\/10.1080\/00207543.2020.1842938","journal-title":"Int J Prod Res Forthc"},{"key":"4392_CR60","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.cor.2019.04.002","volume":"108","author":"G Zhang","year":"2019","unstructured":"Zhang G, Xing K (2019) Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion. Comput Oper Res 108:33\u201343","journal-title":"Comput Oper Res"},{"key":"4392_CR61","doi-asserted-by":"crossref","first-page":"3226","DOI":"10.1080\/00207543.2017.1401241","volume":"56","author":"G Zhang","year":"2018","unstructured":"Zhang G, Xing K, Cao F (2018) Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan. Int J Prod Res 56:3226\u20133244","journal-title":"Int J Prod Res"},{"key":"4392_CR62","doi-asserted-by":"crossref","first-page":"96115","DOI":"10.1109\/ACCESS.2020.2996305","volume":"8","author":"G Zhang","year":"2020","unstructured":"Zhang G, Xing K, Zhang G, He Z (2020) Memetic algorithm with meta-lamarckian learning and simplex search for distributed flexible assembly permutation flowshop scheduling problem. IEEE Access 8:96115\u201396128","journal-title":"IEEE Access"},{"key":"4392_CR63","volume":"160","author":"F Zhao","year":"2020","unstructured":"Zhao F, Zhao L, Wang L, Song H (2020) An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan Criterion. Expert Syst Appl 160:113678","journal-title":"Expert Syst Appl"},{"key":"4392_CR64","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.107082","volume":"153","author":"F Zhao","year":"2021","unstructured":"Zhao F, Zhang L, Cao J, Tang J (2021) A Cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem. Comput Ind Eng 153:107082","journal-title":"Comput Ind Eng"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-022-04392-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-022-04392-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-022-04392-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T14:19:22Z","timestamp":1687357162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-022-04392-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":64,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["4392"],"URL":"https:\/\/doi.org\/10.1007\/s12652-022-04392-w","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,19]]},"assertion":[{"value":"27 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}