{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:54:06Z","timestamp":1774626846437,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819923847","type":"print"},{"value":"9789819923854","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-2385-4_27","type":"book-chapter","created":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T14:03:52Z","timestamp":1683900232000},"page":"367-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Evolutionary Multi-task Genetic Algorithm with Assisted-Task for Flexible Job Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Xuhui","family":"Ning","sequence":"first","affiliation":[]},{"given":"Hong","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Xiaotao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,13]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35, 3202\u20133212 (2008)","journal-title":"Comput. Oper. Res."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1109\/TCYB.2018.2817240","volume":"49","author":"K Gao","year":"2018","unstructured":"Gao, K., Yang, F., Zhou, M., Pan, Q., Suganthan, P.N.: Flexible job-shop rescheduling for new job insertion by using discrete Jaya algorithm. IEEE Trans. Cybern. 49, 1944\u20131955 (2018)","journal-title":"IEEE Trans. Cybern."},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","volume":"56","author":"G Zhang","year":"2009","unstructured":"Zhang, G., Shao, X., Li, P., Gao, L.: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 56, 1309\u20131318 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"LN Xing","year":"2010","unstructured":"Xing, L.N., Chen, Y.W., Wang, P., Zhao, Q.S., Xiong, J.: A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl. Soft Comput. 10, 888\u2013896 (2010)","journal-title":"Appl. Soft Comput."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s00170-010-3140-2","volume":"55","author":"JQ Li","year":"2011","unstructured":"Li, J.Q., Pan, Q.K., Gao, K.Z.: Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int. J. Adv. Manuf. Technol. 55, 1159\u20131169 (2011)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/978-981-15-4745-4_72","volume-title":"Trends in Manufacturing and Engineering Management","author":"RH Caldeira","year":"2021","unstructured":"Caldeira, R.H., Gnanavelbabu, A., JosephSolomon, J.: Solving the flexible job shop scheduling problem using a hybrid artificial bee colony algorithm. In: Vijayan, S., NachiappanSubramanian, K. (eds.) Trends in Manufacturing and Engineering Management. LNME, pp. 833\u2013843. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-15-4745-4_72"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"3343","DOI":"10.1109\/TCYB.2019.2927780","volume":"50","author":"H Zhao","year":"2019","unstructured":"Zhao, H., et al.: Local binary pattern-based adaptive differential evolution for multimodal optimization problems. IEEE Trans. Cybern. 50, 3343\u20133357 (2019)","journal-title":"IEEE Trans. Cybern."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Zhao, H., Li, J., Liu, J.: Localized distance and time-based differential evolution for multimodal optimization problems. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 510\u2013513 (2022)","DOI":"10.1145\/3520304.3528964"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.neucom.2020.12.022","volume":"430","author":"H Zhao","year":"2021","unstructured":"Zhao, H., Chen, Z.-G., Zhan, Z.-H., Kwong, S., Zhang, J.: Multiple populations co-evolutionary particle swarm optimization for multi-objective cardinality constrained portfolio optimization problem. Neurocomputing 430, 58\u201370 (2021)","journal-title":"Neurocomputing"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","volume":"6","author":"K Gao","year":"2019","unstructured":"Gao, K., Cao, Z., Zhang, L., Chen, Z., Han, Y., Pan, Q.: A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE\/CAA J. Autom. Sin. 6, 904\u2013916 (2019)","journal-title":"IEEE\/CAA J. Autom. Sin."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.asoc.2018.08.019","volume":"73","author":"G Shao","year":"2018","unstructured":"Shao, G., Shangguan, Y., Tao, J., Zheng, J., Liu, T., Wen, Y.: An improved genetic algorithm for structural optimization of Au\u2013Ag bimetallic nanoparticles. Appl. Soft Comput. 73, 39\u201349 (2018)","journal-title":"Appl. Soft Comput."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang, G., Gao, L., Shi, Y.: An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst. Appl. 38, 3563\u20133573 (2011)","journal-title":"Expert Syst. Appl."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"XY Li","year":"2016","unstructured":"Li, X.Y., Gao, L.: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int. J. Prod. Econ. 174, 93\u2013110 (2016)","journal-title":"Int. J. Prod. Econ."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput. Oper. Res. 35, 2892\u20132907 (2008)","journal-title":"Comput. Oper. Res."},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"106778","DOI":"10.1016\/j.cie.2020.106778","volume":"149","author":"R Chen","year":"2020","unstructured":"Chen, R., Yang, B., Li, S., Wang, S.: A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput. Ind. Eng. 149, 106778 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TEVC.2015.2458037","volume":"20","author":"A Gupta","year":"2015","unstructured":"Gupta, A., Ong, Y.-S., Feng, L.: Multifactorial evolution: toward evolutionary multitasking. IEEE Trans. Evol. Comput. 20, 343\u2013357 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1109\/TEVC.2021.3139437","volume":"26","author":"T Wei","year":"2021","unstructured":"Wei, T., Wang, S., Zhong, J., Liu, D., Zhang, J.: A review on evolutionary multi-task optimization: trends and challenges. IEEE Trans. Evol. Comput. 26, 941\u2013960 (2021). https:\/\/doi.org\/10.1109\/TEVC.2021.3139437","journal-title":"IEEE Trans. Evol. Comput."},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s12559-022-10012-8","volume":"14","author":"E Osaba","year":"2022","unstructured":"Osaba, E., Del Ser, J., Martinez, A.D., Hussain, A.: Evolutionary multitask optimization: a methodological overview, challenges, and future research directions. Cogn. Comput. 14, 927\u2013954 (2022)","journal-title":"Cogn. Comput."},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1109\/TEVC.2021.3065707","volume":"25","author":"F Zhang","year":"2021","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M., Tan, K.C.: Surrogate-assisted evolutionary multitask genetic programming for dynamic flexible job shop scheduling. IEEE Trans. Evol. Comput. 25, 651\u2013665 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Ong, Y.S., Gupta, A., Tan, P.S., Xu, H.: Evolutionary multitasking in permutation-based combinatorial optimization problems: realization with TSP, QAP, LOP, and JSP. In: 2016 IEEE Region 10 Conference (TENCON), pp. 3157\u20133164. IEEE (2016)","DOI":"10.1109\/TENCON.2016.7848632"},{"key":"27_CR22","unstructured":"Davis, L.: Applying adaptive algorithms to epistatic domains. In: IJCAI, pp. 162\u2013164 (1985)"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41, 157\u2013183 (1993)","journal-title":"Ann. Oper. Res."},{"key":"27_CR24","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"Bagheri, A., Zandieh, M., Mahdavi, I., Yazdani, M.: An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener. Comput. Syst. 26, 533\u2013541 (2010)","journal-title":"Future Gener. Comput. Syst."},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Lee, K. M., Yamakawa, T., Lee, K.-M.: A genetic algorithm for general machine scheduling problems. In: 1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES 1998 (Cat. No. 98EX111), pp. 60\u201366. IEEE (1998)","DOI":"10.1109\/KES.1998.725893"},{"key":"27_CR26","doi-asserted-by":"publisher","first-page":"5278","DOI":"10.1080\/00207543.2018.1467575","volume":"56","author":"T Meng","year":"2018","unstructured":"Meng, T., Pan, Q.-K., Sang, H.-Y.: A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations. Int. J. Prod. Res. 56, 5278\u20135292 (2018)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"27_CR27","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","volume":"29","author":"M Nouiri","year":"2015","unstructured":"Nouiri, M., Bekrar, A., Jemai, A., Niar, S., Ammari, A.C.: An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. J. Intell. Manuf. 29(3), 603\u2013615 (2015). https:\/\/doi.org\/10.1007\/s10845-015-1039-3","journal-title":"J. Intell. Manuf."},{"key":"27_CR28","doi-asserted-by":"publisher","first-page":"106262","DOI":"10.1016\/j.knosys.2020.106262","volume":"205","author":"P Liao","year":"2020","unstructured":"Liao, P., Sun, C., Zhang, G., Jin, Y.: Multi-surrogate multi-tasking optimization of expensive problems. Knowl. Based Syst. 205, 106262 (2020)","journal-title":"Knowl. Based Syst."},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Wang, C., Wu, K., Liu, J.: Evolutionary multitasking AUC optimization. arXiv preprint arXiv:2201.01145 (2022)","DOI":"10.1109\/MCI.2022.3155325"}],"container-title":["Communications in Computer and Information Science","Computer Supported Cooperative Work and Social Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-2385-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T08:31:14Z","timestamp":1729413074000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-2385-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819923847","9789819923854"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-2385-4_27","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ChineseCSCW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"CCF Conference on Computer Supported Cooperative Work and Social Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Datong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"chinesecscw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.scholat.com\/ccscw\/2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"211","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}