{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T11:14:56Z","timestamp":1783768496460,"version":"3.55.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"}],"funder":[{"name":"the national key r&d program of china","award":["2019YFB1704600"],"award-info":[{"award-number":["2019YFB1704600"]}]},{"DOI":"10.13039\/501100001809","name":"the national natural science foundation of china","doi-asserted-by":"crossref","award":["51825502"],"award-info":[{"award-number":["51825502"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the national natural science foundation of china","doi-asserted-by":"crossref","award":["U21B2029"],"award-info":[{"award-number":["U21B2029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the program for hust academic frontier youth team","award":["2017QYTD04"],"award-info":[{"award-number":["2017QYTD04"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s12293-022-00364-x","type":"journal-article","created":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T06:03:30Z","timestamp":1652076210000},"page":"193-209","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A multiobjective memetic algorithm for integrated process planning and scheduling problem in distributed heterogeneous manufacturing systems"],"prefix":"10.1007","volume":"14","author":[{"given":"Qihao","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guangchen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,9]]},"reference":[{"key":"364_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.01.003","volume":"93","author":"R Barzanji","year":"2019","unstructured":"Barzanji R, Naderi B, Begen MA (2019) Decomposition algorithms for the integrated process planning and scheduling problem. Omega 93:102025","journal-title":"Omega"},{"issue":"1","key":"364_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyz\u017cak","year":"1998","unstructured":"Czyz\u017cak P, Jaszkiewicz A (1998) Pareto simulated annealing\u2014a metaheuristic technique for multiple-objective combinatorial optimization. J Multi-Criteria Decis Anal 7(1):34\u201347","journal-title":"J Multi-Criteria Decis Anal"},{"issue":"2","key":"364_CR3","doi-asserted-by":"publisher","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(2):395\u2013408","journal-title":"Eur J Oper Res"},{"issue":"1","key":"364_CR4","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0377-2217(00)00140-5","volume":"132","author":"PM Franca","year":"2001","unstructured":"Franca PM, Mendes A, Moscato P (2001) A memetic algorithm for the total tardiness single machine scheduling problem. Eur J Oper Res 132(1):224\u2013242","journal-title":"Eur J Oper Res"},{"issue":"1","key":"364_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1177\/1063293X02010001054","volume":"10","author":"HZ Jia","year":"2002","unstructured":"Jia HZ, Fuh JYH, Nee AYC, Zhang YF (2002) Web-based multi-functional scheduling system for a distributed manufacturing environment. Concurr Eng Res Appl 10(1):27\u201339","journal-title":"Concurr Eng Res Appl"},{"issue":"5\u20138","key":"364_CR6","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1007\/s00170-015-8037-7","volume":"85","author":"L Jin","year":"2016","unstructured":"Jin L, Zhang C, Shao X, Yang X, Tian G (2016) A multi-objective memetic algorithm for integrated process planning and scheduling. Int J Adv Manuf Technol 85(5\u20138):1513\u20131528","journal-title":"Int J Adv Manuf Technol"},{"key":"364_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106946","volume":"100","author":"H Li","year":"2021","unstructured":"Li H, Xinyu L, Liang G (2021) 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"},{"issue":"1","key":"364_CR8","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.eswa.2011.07.019","volume":"39","author":"X Li","year":"2012","unstructured":"Li X, Gao L, Li W (2012) Application of game theory based hybrid algorithm for multi-objective integrated process planning and scheduling. Expert Syst Appl 39(1):288\u2013297","journal-title":"Expert Syst Appl"},{"issue":"4","key":"364_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s12293-019-00283-4","volume":"11","author":"X Li","year":"2019","unstructured":"Li X, Xiao S, Wang C, Yi J (2019) Mathematical modeling and a discrete artificial bee colony algorithm for the welding shop scheduling problem. Memet Comput 11(4):371\u2013389","journal-title":"Memet Comput"},{"issue":"17","key":"364_CR10","first-page":"2344","volume":"26","author":"Y Li","year":"2015","unstructured":"Li Y, Ba L, Cao Y, Liu Y, Yang M (2015) Research on integrated process planning and scheduling problem with consideration of multi-objectives. China Mech Eng 26(17):2344","journal-title":"China Mech Eng"},{"key":"364_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106638","volume":"147","author":"Y Li","year":"2020","unstructured":"Li Y, Li X, Gao L, Meng L (2020) 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"},{"issue":"4","key":"364_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s12293-019-00290-5","volume":"11","author":"J Liang","year":"2019","unstructured":"Liang J, Wang P, Guo L, Qu B, Yue C, Yu K, Wang Y (2019) Multi-objective flow shop scheduling with limited buffers using hybrid self-adaptive differential evolution. Memet Comput 11(4):407\u2013422","journal-title":"Memet Comput"},{"key":"364_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105053","volume":"124","author":"C-S Lin","year":"2020","unstructured":"Lin C-S, Li P-Y, Wei J-M, Wu M-C (2020) Integration of process planning and scheduling for distributed flexible job shops. Comput Oper Res 124:105053","journal-title":"Comput Oper Res"},{"issue":"3","key":"364_CR14","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s10845-020-01703-w","volume":"32","author":"Q Liu","year":"2021","unstructured":"Liu Q, Li X, Gao L (2021) Mathematical modeling and a hybrid evolutionary algorithm for process planning. J Intell Manuf 32(3):781\u2013797","journal-title":"J Intell Manuf"},{"issue":"6","key":"364_CR15","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.eng.2021.04.011","volume":"7","author":"Q Liu","year":"2021","unstructured":"Liu Q, Li X, Gao L (2021) A novel MILP model based on the topology of a network graph for process planning in an intelligent manufacturing system. Engineering 7(6):807\u2013817","journal-title":"Engineering"},{"issue":"9","key":"364_CR16","doi-asserted-by":"publisher","first-page":"4429","DOI":"10.1109\/TCYB.2020.3026651","volume":"51","author":"Q Liu","year":"2020","unstructured":"Liu Q, Li X, Gao L, Li Y (2020) A modified genetic algorithm with new encoding and decoding methods for integrated process planning and scheduling problem. IEEE Trans Cybern 51(9):4429\u20134438","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"364_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10845-010-0407-2","volume":"24","author":"XJ Liu","year":"2013","unstructured":"Liu XJ, Yi H, Ni ZH (2013) Application of ant colony optimization algorithm in process planning optimization. J Intell Manuf 24(1):1\u201313","journal-title":"J Intell Manuf"},{"key":"364_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100803","volume":"60","author":"C Lu","year":"2021","unstructured":"Lu C, Gao L, Gong W, Hu C, Li X (2021) Sustainable scheduling of distributed permutation flow-shop with non-identical factory using a knowledge-based multi-objective memetic optimization algorithm. Swarm Evol Comput 60:100803","journal-title":"Swarm Evol Comput"},{"key":"364_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106347","volume":"142","author":"L Meng","year":"2020","unstructured":"Meng L, Zhang C, Ren Y, Zhang B, Lv C (2020) Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput Ind Eng 142:106347","journal-title":"Comput Ind Eng"},{"issue":"18","key":"364_CR20","doi-asserted-by":"publisher","first-page":"5063","DOI":"10.1080\/00207543.2011.631602","volume":"50","author":"G Mohammadi","year":"2012","unstructured":"Mohammadi G, Karampourhaghghi A, Samaei F (2012) A multi-objective optimisation model to integrating flexible process planning and scheduling based on hybrid multi-objective simulated annealing. Int J Prod Res 50(18):5063\u20135076","journal-title":"Int J Prod Res"},{"issue":"23\u201324","key":"364_CR21","doi-asserted-by":"publisher","first-page":"7190","DOI":"10.1080\/00207543.2013.853890","volume":"51","author":"P Mohapatra","year":"2013","unstructured":"Mohapatra P, Benyoucef L, Tiwari MK (2013) Integration of process planning and scheduling through adaptive setup planning: a multi-objective approach. Int J Prod Res 51(23\u201324):7190\u20137208","journal-title":"Int J Prod Res"},{"issue":"6","key":"364_CR22","doi-asserted-by":"publisher","first-page":"1712","DOI":"10.1080\/00207543.2014.957872","volume":"53","author":"P Mohapatra","year":"2015","unstructured":"Mohapatra P, Nayak A, Kumar SK, Tiwari MK (2015) Multi-objective process planning and scheduling using controlled elitist non-dominated sorting genetic algorithm. Int J Prod Res 53(6):1712\u20131735","journal-title":"Int J Prod Res"},{"issue":"4","key":"364_CR23","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Na De Ri","year":"2010","unstructured":"Na De Ri B, Ruiz R (2010) The distributed permutation flowshop scheduling problem. Comput Oper Res 37(4):754\u2013768","journal-title":"Comput Oper Res"},{"issue":"6540","key":"364_CR24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1126\/science.abg4924","volume":"372","author":"CE Okwudire","year":"2021","unstructured":"Okwudire CE, Madhyastha HV (2021) Distributed manufacturing for and by the masses. Science (New York, N. Y.) 372(6540):341\u2013342","journal-title":"Science (New York, N. Y.)"},{"issue":"4","key":"364_CR25","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s12293-017-0230-9","volume":"9","author":"A Phu-ang","year":"2017","unstructured":"Phu-ang A, Thammano A (2017) Memetic algorithm based on marriage in honey bees optimization for flexible job shop scheduling problem. Memet Comput 9(4):295\u2013309","journal-title":"Memet Comput"},{"issue":"2","key":"364_CR26","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s12293-021-00329-6","volume":"13","author":"H Qin","year":"2021","unstructured":"Qin H, Li T, Teng Y, Wang K (2021) Integrated production and distribution scheduling in distributed hybrid flow shops. Memet Comput 13(2):185\u2013202","journal-title":"Memet Comput"},{"issue":"3","key":"364_CR27","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s12293-012-0084-0","volume":"4","author":"NMR Raeesi","year":"2012","unstructured":"Raeesi NMR, Kobti Z (2012) A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic. Memet Comput 4(3):231\u2013245","journal-title":"Memet Comput"},{"issue":"4","key":"364_CR28","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/TSMCC.2006.874022","volume":"36","author":"W Shen","year":"2006","unstructured":"Shen W, Wang L, Hao Q (2006) Agent-based distributed manufacturing process planning and scheduling: a state-of-the-art survey. IEEE Trans Syst Man Cybern Part C Appl Rev 36(4):563\u2013577","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"issue":"1","key":"364_CR29","first-page":"61","volume":"6","author":"E Shokouhi","year":"2018","unstructured":"Shokouhi E (2018) Integrated multi-objective process planning and flexible job shop scheduling considering precedence constraints. Prod Manuf Res Open Access J 6(1):61\u201389","journal-title":"Prod Manuf Res Open Access J"},{"key":"364_CR30","unstructured":"Van Veldhuizen DA, Lamont GB (1998) Evolutionary computation and convergence to a pareto front. In: Paper presented at the Late breaking papers at the genetic programming 1998 conference"},{"issue":"5","key":"364_CR31","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1109\/TSMC.2017.2788879","volume":"50","author":"J-J Wang","year":"2020","unstructured":"Wang J-J, Wang L (2020) A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop. IEEE Trans Syst Man Cybern Syst 50(5):1805\u20131819","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"364_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100820","volume":"61","author":"X Wen","year":"2021","unstructured":"Wen X, Wang K, Li H, Sun H, Wang H, Jin L (2021) A two-stage solution method based on NSGA-II for green multi-objective integrated process planning and scheduling in a battery packaging machinery workshop. Swarm Evolut Comput 61:100820","journal-title":"Swarm Evolut Comput"},{"issue":"4","key":"364_CR33","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s12293-018-00278-7","volume":"11","author":"X Wu","year":"2019","unstructured":"Wu X, Liu X, Zhao N (2019) An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem. Memet Comput 11(4):335\u2013355","journal-title":"Memet Comput"},{"key":"364_CR34","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.eswa.2017.09.032","volume":"92","author":"K-C Ying","year":"2018","unstructured":"Ying K-C, Lin S-W (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":"364_CR35","doi-asserted-by":"crossref","unstructured":"Zhang S, Yu Z, Zhang W, Yu D, Xu Y (2016) An extended genetic algorithm for distributed integration of fuzzy process planning and scheduling. Math Probl Eng 2016","DOI":"10.1155\/2016\/3763512"},{"issue":"5","key":"364_CR36","first-page":"1587","volume":"11","author":"S Zhang","year":"2015","unstructured":"Zhang S, Yu Z, Zhang W, Yu D, Zhang D (2015) Distributed integration of process planning and scheduling using an enhanced genetic algorithm. Int J Innov Comput Inf Control 11(5):1587\u20131602","journal-title":"Int J Innov Comput Inf Control"},{"issue":"23","key":"364_CR37","doi-asserted-by":"publisher","first-page":"6181","DOI":"10.3390\/en13236181","volume":"13","author":"X Zhang","year":"2020","unstructured":"Zhang X, Zhang H, Yao J (2020) Multi-objective optimization of integrated process planning and scheduling considering energy savings. Energies 13(23):6181","journal-title":"Energies"},{"key":"364_CR38","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1016\/j.jclepro.2016.03.101","volume":"137","author":"Z Zhang","year":"2016","unstructured":"Zhang Z, Tang R, Peng T, Tao L, Jia S (2016) A method for minimizing the energy consumption of machining system: integration of process planning and scheduling. J Clean Prod 137:1647\u20131662","journal-title":"J Clean Prod"},{"issue":"1","key":"364_CR39","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10845-015-1091-z","volume":"29","author":"B Zhao","year":"2018","unstructured":"Zhao B, Gao J, Chen K, Guo K (2018) Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines. J Intell Manuf 29(1):93\u2013108","journal-title":"J Intell Manuf"},{"key":"364_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113678","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"},{"issue":"2","key":"364_CR41","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s12293-022-00364-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s12293-022-00364-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s12293-022-00364-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T02:08:54Z","timestamp":1652407734000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s12293-022-00364-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,9]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["364"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s12293-022-00364-x","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,9]]},"assertion":[{"value":"14 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 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":"Qihao Liu, Xinyu Li, Liang Gao declare that they have no conflict of interest or financial conflicts to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}