{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T18:38:17Z","timestamp":1778783897198,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_4","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"48-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Importance-Aware Genetic Programming for\u00a0Automated Scheduling Heuristics Learning in\u00a0Dynamic Flexible Job Shop Scheduling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5516-3972","authenticated-orcid":false,"given":"Fangfang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0682-1363","authenticated-orcid":false,"given":"Yi","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1153-5022","authenticated-orcid":false,"given":"Su","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4463-9538","authenticated-orcid":false,"given":"Mengjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s10845-012-0626-9","volume":"24","author":"L Nie","year":"2013","unstructured":"Nie, L., Gao, L., Li, P., Li, X.: A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. J. Intell. Manuf. 24(4), 763\u2013774 (2013)","journal-title":"J. Intell. Manuf."},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-030-44094-7_17","volume-title":"Genetic Programming","author":"F Zhang","year":"2020","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Guided subtree selection for genetic operators in genetic programming for dynamic flexible job shop scheduling. In: Hu, T., Louren\u00e7o, N., Medvet, E., Divina, F. (eds.) EuroGP 2020. LNCS, vol. 12101, pp. 262\u2013278. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44094-7_17"},{"key":"4_CR3","series-title":"Machine Learning: Foundations, Methodologies, and Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-4859-5","volume-title":"Genetic Programming for Production Scheduling","author":"F Zhang","year":"2021","unstructured":"Zhang, F., Nguyen, S., Mei, Y., Zhang, M.: Genetic Programming for Production Scheduling. MLFMA, Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-16-4859-5"},{"issue":"8","key":"4_CR4","doi-asserted-by":"publisher","first-page":"2083","DOI":"10.1016\/j.cor.2013.03.007","volume":"40","author":"S Nguyen","year":"2013","unstructured":"Nguyen, S., Zhang, M., Johnston, M., Chen Tan, K.: Hybrid evolutionary computation methods for quay crane scheduling problems. Comput. Oper. Res. 40(8), 2083\u20132093 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10710-005-7580-7","volume":"6","author":"E Hart","year":"2005","unstructured":"Hart, E., Ross, P., Corne, D.: Evolutionary scheduling: a review. Genet. Program Evolvable Mach. 6(2), 191\u2013220 (2005)","journal-title":"Genet. Program Evolvable Mach."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Jaklinovi\u0107, K., Durasevi\u0107, M., Jakobovi\u0107, D.: Designing dispatching rules with genetic programming for the unrelated machines environment with constraints. Exp. Syst. Appl. 172, 114548 (2021)","DOI":"10.1016\/j.eswa.2020.114548"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1109\/TEVC.2021.3056143","volume":"25","author":"F Zhang","year":"2021","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Correlation coefficient-based recombinative guidance for genetic programming hyperheuristics in dynamic flexible job shop scheduling. IEEE Trans. Evol. Comput. 25(3), 552\u2013566 (2021). https:\/\/doi.org\/10.1109\/TEVC.2021.3056143","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF00175355","volume":"4","author":"JR Koza","year":"1994","unstructured":"Koza, J.R.: Genetic programming as a means for programming computers by natural selection. Stat. Comput. 4(2), 87\u2013112 (1994)","journal-title":"Stat. Comput."},{"issue":"12","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., et al.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"108342","DOI":"10.1016\/j.ijpe.2021.108342","volume":"243","author":"R Braune","year":"2022","unstructured":"Braune, R., Benda, F., Doerner, K.F., Hartl, R.F.: A genetic programming learning approach to generate dispatching rules for flexible shop scheduling problems. Int. J. Prod. Econ. 243, 108342 (2022)","journal-title":"Int. J. Prod. Econ."},{"key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96514-7","volume-title":"Hyper-Heuristics: Theory and Applications","author":"N Pillay","year":"2018","unstructured":"Pillay, N., Qu, R.: Hyper-Heuristics: Theory and Applications. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96514-7"},{"issue":"8","key":"4_CR12","doi-asserted-by":"publisher","first-page":"8142","DOI":"10.1109\/TCYB.2021.3050141","volume":"52","author":"F Zhang","year":"2022","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Collaborative multifidelity-based surrogate models for genetic programming in dynamic flexible job shop scheduling. IEEE Trans. Cybern. 52(8), 8142\u20138156 (2022). https:\/\/doi.org\/10.1109\/TCYB.2021.3050141","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"4_CR13","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(4), 651\u2013665 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Tan, K.C., Zhang, M.: Multitask genetic programming-based generative hyper-heuristics: a case study in dynamic scheduling. IEEE Trans. Cybern. (2021). https:\/\/doi.org\/10.1109\/TCYB.2021.3065340","DOI":"10.1109\/TCYB.2021.3065340"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"106059","DOI":"10.1016\/j.asoc.2019.106059","volume":"88","author":"X Shen","year":"2020","unstructured":"Shen, X., Guo, Y., Li, A.: Cooperative coevolution with an improved resource allocation for large-scale multi-objective software project scheduling. Appl. Soft Comput. 88, 106059 (2020)","journal-title":"Appl. Soft Comput."},{"issue":"12","key":"4_CR16","doi-asserted-by":"publisher","first-page":"4180","DOI":"10.1109\/TCYB.2018.2859635","volume":"49","author":"Z Ren","year":"2018","unstructured":"Ren, Z., Liang, Y., Zhang, A., Yang, Y., Feng, Z., Wang, L.: Boosting cooperative coevolution for large scale optimization with a fine-grained computation resource allocation strategy. IEEE Trans. Cybern. 49(12), 4180\u20134193 (2018)","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/TEVC.2016.2627581","volume":"21","author":"M Yang","year":"2017","unstructured":"Yang, M., et al.: Efficient resource allocation in cooperative co-evolution for large-scale global optimization. IEEE Trans. Evol. Comput. 21(4), 493\u2013505 (2017). https:\/\/doi.org\/10.1109\/TEVC.2016.2627581","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"4_CR18","doi-asserted-by":"publisher","first-page":"4246","DOI":"10.1109\/TCYB.2020.3025577","volume":"52","author":"Y-H Jia","year":"2020","unstructured":"Jia, Y.-H., Mei, Y., Zhang, M.: Contribution-based cooperative co-evolution for nonseparable large-scale problems with overlapping subcomponents. IEEE Trans. Cybern. 52(6), 4246\u20134259 (2020). https:\/\/doi.org\/10.1109\/TCYB.2020.3025577","journal-title":"IEEE Trans. Cybern."},{"issue":"6","key":"4_CR19","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1109\/TEVC.2019.2895860","volume":"23","author":"X-Y Zhang","year":"2019","unstructured":"Zhang, X.-Y., Gong, Y.-J., Lin, Y., Zhang, J., Kwong, S., Zhang, J.: Dynamic cooperative coevolution for large scale optimization. IEEE Trans. Evol. Comput. 23(6), 935\u2013948 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369\u2013375 (1990)","journal-title":"Computing"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: A preliminary approach to evolutionary multitasking for dynamic flexible job shop scheduling via genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 107\u2013108. ACM (2020)","DOI":"10.1145\/3377929.3389934"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.eswa.2018.06.053","volume":"113","author":"M Durasevic","year":"2018","unstructured":"Durasevic, M., Jakobovic, D.: A survey of dispatching rules for the dynamic unrelated machines environment. Exp. Syst. Appl. 113, 555\u2013569 (2018)","journal-title":"Exp. Syst. Appl."},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1162\/EVCO_a_00183","volume":"24","author":"E Hart","year":"2016","unstructured":"Hart, E., Sim, K.: A hyper-heuristic ensemble method for static job-shop scheduling. Evol. Comput. 24(4), 609\u2013635 (2016)","journal-title":"Evol. Comput."},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-030-43680-3_14","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"F Zhang","year":"2020","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Genetic programming with adaptive search based on the frequency of features for dynamic flexible job shop scheduling. In: Paquete, L., Zarges, C. (eds.) EvoCOP 2020. LNCS, vol. 12102, pp. 214\u2013230. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43680-3_14"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-319-77553-1_19","volume-title":"Genetic Programming","author":"D Yska","year":"2018","unstructured":"Yska, D., Mei, Y., Zhang, M.: Genetic programming hyper-heuristic with cooperative coevolution for dynamic flexible job shop scheduling. In: Castelli, M., Sekanina, L., Zhang, M., Cagnoni, S., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2018. LNCS, vol. 10781, pp. 306\u2013321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77553-1_19"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, F., Mei, Y., Zhang, M.: A two-stage genetic programming hyper-heuristic approach with feature selection for dynamic flexible job shop scheduling. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 347\u2013355. ACM (2019)","DOI":"10.1145\/3321707.3321790"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Hildebrandt, T., Heger, J., Reiter, B.S.: Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach. In: Proceedings of the Conference on Genetic and Evolutionary Computation, pp. 257\u2013264. ACM (2010)","DOI":"10.1145\/1830483.1830530"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Tan, K.C., Zhang, M.: Instance rotation based surrogate in genetic programming with brood recombination for dynamic job shop scheduling. IEEE Trans. Evol. Comput. (2022). https:\/\/doi.org\/10.1109\/TEVC.2022.3180693","DOI":"10.1109\/TEVC.2022.3180693"},{"issue":"3","key":"4_CR29","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1162\/EVCO_a_00133","volume":"23","author":"T Hildebrandt","year":"2015","unstructured":"Hildebrandt, T., Branke, J.: On using surrogates with genetic programming. Evol. Comput. 23(3), 343\u2013367 (2015)","journal-title":"Evol. Comput."},{"issue":"4","key":"4_CR30","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1109\/TCYB.2020.3024849","volume":"51","author":"F Zhang","year":"2021","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Evolving scheduling heuristics via genetic programming with feature selection in dynamic flexible job-shop scheduling. IEEE Trans. Cybern. 51(4), 1797\u20131811 (2021)","journal-title":"IEEE Trans. Cybern."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:47:28Z","timestamp":1710262048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 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":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","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":"85","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":"0","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":"46% - 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.75","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":"3.11","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}