{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T15:27:38Z","timestamp":1767108458576,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"27","license":[{"start":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T00:00:00Z","timestamp":1689897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T00:00:00Z","timestamp":1689897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Intelligent Manufacturing Integrated Standardization and New Model Application Project in 2016 of MIIT","award":["Grant (2016) 213"],"award-info":[{"award-number":["Grant (2016) 213"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s00521-023-08792-7","type":"journal-article","created":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T07:03:11Z","timestamp":1689922991000},"page":"20403-20422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Solving a many-objective PFSP with reinforcement cumulative prospect theory in low-volume PCB manufacturing"],"prefix":"10.1007","volume":"35","author":[{"given":"Chen","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4468-258X","authenticated-orcid":false,"given":"GuangYu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,21]]},"reference":[{"key":"8792_CR1","doi-asserted-by":"publisher","first-page":"124405","DOI":"10.1016\/j.jclepro.2020.124405","volume":"280","author":"J Leng","year":"2021","unstructured":"Leng J, Ruan G, Song Y, Liu Q, Fu Y, Ding K, Chen X (2021) A loosely-coupled deep reinforcement learning approach for order acceptance decision of mass-individualized printed circuit board manufacturing in industry 40. J Clean Prod 280:124405","journal-title":"J Clean Prod"},{"issue":"24","key":"8792_CR2","doi-asserted-by":"publisher","first-page":"22303","DOI":"10.1007\/s00521-022-07714-3","volume":"34","author":"W Shao","year":"2022","unstructured":"Shao W, Shao Z, Pi D (2022) A multi-neighborhood-based multi-objective memetic algorithm for the energy-efficient distributed flexible flow shop scheduling problem. Neural Comput Appl 34(24):22303\u201322330","journal-title":"Neural Comput Appl"},{"issue":"8","key":"8792_CR3","doi-asserted-by":"publisher","first-page":"3469","DOI":"10.1007\/s00521-020-05174-1","volume":"33","author":"OA Ark","year":"2020","unstructured":"Ark OA (2020) Artificial bee colony algorithm including some components of iterated greedy algorithm for permutation flow shop scheduling problems. Neural Comput Appl 33(8):3469\u20133486","journal-title":"Neural Comput Appl"},{"issue":"3","key":"8792_CR4","doi-asserted-by":"publisher","first-page":"1963","DOI":"10.1007\/s00521-021-06504-7","volume":"34","author":"S Suhaila","year":"2022","unstructured":"Suhaila S, Ahmad K, Wan Z, Azman W, Zainab Y (2022) Modified job shop scheduling via Taguchi method and genetic algorithm. Neural Comput Appl 34(3):1963\u20131980","journal-title":"Neural Comput Appl"},{"key":"8792_CR5","doi-asserted-by":"publisher","first-page":"114793","DOI":"10.1016\/j.eswa.2021.114793","volume":"174","author":"Y Wang","year":"2021","unstructured":"Wang Y, Wang S, Li D, Shen C, Yang B (2021) An improved multi-objective whale optimization algorithm for the hybrid flow shop scheduling problem considering device dynamic reconfiguration processes. Expert Syst with Appl 174:114793","journal-title":"Expert Syst with Appl"},{"key":"8792_CR6","doi-asserted-by":"publisher","first-page":"106382","DOI":"10.1016\/j.asoc.2020.106382","volume":"93","author":"Q Liu","year":"2020","unstructured":"Liu Q, Li X, Liu H, Guo Z (2020) Multi-objective metaheuristics for discrete optimization problems: a review of the state-of-the-art. Appl Soft Comput 93:106382","journal-title":"Appl Soft Comput"},{"issue":"3","key":"8792_CR7","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1016\/j.ejor.2017.08.022","volume":"265","author":"G Zhu","year":"2018","unstructured":"Zhu G, He L, Ju X, Zhang W (2018) A fitness assignment strategy based on the grey and entropy parallel analysis and its application to MOEA. Eur J Oper Res 265(3):813\u2013828","journal-title":"Eur J Oper Res"},{"key":"8792_CR8","first-page":"98","volume":"7","author":"Z Pan","year":"2019","unstructured":"Pan Z (2019) A review of prospect theory. J Hum Res Sustain Stud 7:98\u2013107","journal-title":"J Hum Res Sustain Stud"},{"issue":"11","key":"8792_CR9","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1002\/int.21896","volume":"32","author":"X Peng","year":"2017","unstructured":"Peng X, Dai J (2017) Approaches to pythagorean fuzzy stochastic multi-criteria decision making based on prospect theory and regret theory with new distance measure and score function. Inter J Intell Syst 32(11):1187\u20131214","journal-title":"Inter J Intell Syst"},{"issue":"1","key":"8792_CR10","first-page":"49","volume":"10","author":"C Li","year":"2016","unstructured":"Li C, Yuan J, Gao P (2016) Risk decision-making based on Mahalanobis\u2013Taguchi system and grey cumulative prospect theory for enterprise information investment. Intell Dec Technol 10(1):49\u201358","journal-title":"Intell Dec Technol"},{"key":"8792_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ins.2020.01.030","volume":"519","author":"T Wang","year":"2020","unstructured":"Wang T, Li H, Zhang L, Zhou X, Huang B (2020) A three-way decision model based on cumulative prospect theory. Inf Sci 519:74\u201392","journal-title":"Inf Sci"},{"key":"8792_CR12","doi-asserted-by":"publisher","first-page":"102534","DOI":"10.1016\/j.jmp.2021.102534","volume":"102","author":"A Grant","year":"2021","unstructured":"Grant A, Johnstone D, Kwon OK (2021) A cumulative prospect theory explanation of gamblers cashing-out. J Math Psychol 102:102534","journal-title":"J Math Psychol"},{"key":"8792_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1177\/1748302620962403","volume":"14","author":"L Zhang","year":"2020","unstructured":"Zhang L, Yu Y, Luo Y, Zhang S (2020) Improved cuckoo search algorithm and its application to permutation flow shop scheduling problem. J Algorithms Comput Technol 14:1\u201312","journal-title":"J Algorithms Comput Technol"},{"key":"8792_CR14","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.asoc.2016.11.047","volume":"51","author":"G Zhu","year":"2017","unstructured":"Zhu G, Zhang W (2017) Optimal foraging algorithm for global optimization. Appl Soft Comput 51:294\u2013313","journal-title":"Appl Soft Comput"},{"key":"8792_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59156-8","volume-title":"Foraging-inspired optimisation algorithms","author":"A Brabazon","year":"2018","unstructured":"Brabazon A, McGarraghy S (2018) Foraging-inspired optimisation algorithms. Springer, Berlin"},{"issue":"6","key":"8792_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-020-09952-0","volume":"54","author":"A Ezugwu","year":"2021","unstructured":"Ezugwu A, Shukla A, Nath R, Akinyelu A, Agushaka J et al (2021) Metaheuristics: a comprehensive overview and classification along with bibliometric analysis. Artif Intell Review 54(6):1\u201380","journal-title":"Artif Intell Review"},{"key":"8792_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2021.06.062","volume":"576","author":"Z Jian","year":"2021","unstructured":"Jian Z, Zhu G (2021) Affine invariance of meta-heuristic algorithms. Inf Sci 576:37\u201353","journal-title":"Inf Sci"},{"issue":"7","key":"8792_CR18","doi-asserted-by":"publisher","first-page":"2847","DOI":"10.1109\/TII.2017.2772314","volume":"14","author":"G Zhu","year":"2018","unstructured":"Zhu G, Zhang W (2018) Drilling path optimization by optimal foraging algorithm. IEEE Trans Ind Inform 14(7):2847\u20132856","journal-title":"IEEE Trans Ind Inform"},{"issue":"11","key":"8792_CR19","doi-asserted-by":"publisher","first-page":"7633","DOI":"10.1007\/s00521-018-3597-8","volume":"31","author":"GI Sayed","year":"2019","unstructured":"Sayed GI, Soliman M, Hassanien AE (2019) A novel chaotic optimal foraging algorithm for unconstrained andconstrained problems and its application in white blood cell segmentation. Neural Comput Appl 31(11):7633\u20137664","journal-title":"Neural Comput Appl"},{"issue":"3","key":"8792_CR20","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1080\/00207543.2019.1705418","volume":"59","author":"W Xu","year":"2021","unstructured":"Xu W, He L, Zhu G (2021) Many-objective flow shop scheduling optimisation with genetic algorithm based on fuzzy sets. Int J Prod Res 59(3):702\u2013726","journal-title":"Int J Prod Res"},{"key":"8792_CR21","doi-asserted-by":"publisher","first-page":"106139","DOI":"10.1016\/j.asoc.2020.106139","volume":"90","author":"RM Ivan","year":"2020","unstructured":"Ivan RM, Marcos A, Ant\u00f3nio G, Frederico G (2020) Scalable and customizable benchmark problems for many-objective optimization. Appl Soft Comput 90:106139","journal-title":"Appl Soft Comput"},{"issue":"4","key":"8792_CR22","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2018","unstructured":"Jain H, Deb K (2018) An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part II: handling constraints and extending to an adaptive approach. IEEE Trans Evol Comput 18(4):602\u2013622","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"8792_CR23","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TEVC.2015.2443001","volume":"20","author":"Y Yuan","year":"2016","unstructured":"Yuan Y, Xu H, Wang B, Zhang B, Yao X (2016) Balancing convergence and diversity in decomposition-based many-objective optimizers. IEEE Trans Evol Comput 20(2):180\u2013198","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"8792_CR24","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng R, Jin Y, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(5):773\u2013791","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"8792_CR25","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TEVC.2017.2749619","volume":"22","author":"Y Tian","year":"2018","unstructured":"Tian Y, Cheng R, Zhang X, Jin Y (2018) An indicator-based multiobjective evolutionary algorithm with reference point adaptation for better versatility. IEEE Trans Evol Comput 22(4):609\u2013622","journal-title":"IEEE Trans Evol Comput"},{"issue":"7","key":"8792_CR26","doi-asserted-by":"publisher","first-page":"2758","DOI":"10.1109\/TCYB.2018.2834466","volume":"49","author":"Y Hua","year":"2019","unstructured":"Hua Y, Jin Y, Hao K (2019) A clustering-based adaptive evolutionary algorithm for multiobjective optimization with irregular Pareto fronts. IEEE Trans Cybern 49(7):2758\u20132770","journal-title":"IEEE Trans Cybern"},{"issue":"7","key":"8792_CR27","doi-asserted-by":"publisher","first-page":"2054","DOI":"10.1109\/TFUZZ.2020.2985333","volume":"29","author":"W Zhang","year":"2021","unstructured":"Zhang W, Zhu G (2021) A multiobjective optimization of PCB prototyping assembly with OFA based on the similarity of intuitionistic fuzzy sets. IEEE Trans Fuzzy Syst 29(7):2054\u20132061","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"8792_CR28","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.ins.2021.03.008","volume":"563","author":"L Li","year":"2021","unstructured":"Li L, Yen GG, Sahoo A et al (2021) On the estimation of pareto front and dimensional similarity in many-objective evolutionary algorithm. Inf Sci 563:375\u2013400","journal-title":"Inf Sci"},{"issue":"2","key":"8792_CR29","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi H, Yoshida Y, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2):204\u2013223","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"8792_CR30","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1162\/evco_a_00276","volume":"29","author":"L Chen","year":"2021","unstructured":"Chen L, De K, Liu H, Zhang Q (2021) Effect of objective normalization and penalty parameter on penalty boundary intersection decomposition-based evolutionary many-objective optimization algorithms. Evol Comput 29(1):157\u2013186","journal-title":"Evol Comput"},{"issue":"1","key":"8792_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2020.3013290","volume":"25","author":"K Shang","year":"2021","unstructured":"Shang K, Hisao I, He L, Pang L (2021) A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Trans Evol Comput 25(1):1\u201320","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08792-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-08792-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08792-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:15:45Z","timestamp":1693354545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-08792-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,21]]},"references-count":31,"journal-issue":{"issue":"27","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["8792"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-08792-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2023,7,21]]},"assertion":[{"value":"31 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}