{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T22:40:11Z","timestamp":1756248011338,"version":"3.44.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032035493","type":"print"},{"value":"9783032035509","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-03550-9_12","type":"book-chapter","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T22:04:23Z","timestamp":1756245863000},"page":"173-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Transformer-Based Approach for Fitness Prediction in the Flexible Job Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Shady","family":"Salama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mate","family":"Kovacs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guhan","family":"Elangovan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-2361-4","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: A novel feature selection for evolving compact dispatching rules using genetic programming for dynamic job shop scheduling. Int. J. Prod. Res. 1\u201324 (2022). https:\/\/doi.org\/10.1080\/00207543.2022.2053603","DOI":"10.1080\/00207543.2022.2053603"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: Feature selection approach for evolving reactive scheduling policies for dynamic job shop scheduling problem using gene expression programming. Int. J. Prod. Res. 1\u201324 (2022). https:\/\/doi.org\/10.1080\/00207543.2022.2092041","DOI":"10.1080\/00207543.2022.2092041"},{"key":"12_CR4","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, 1797\u20131811 (2021). https:\/\/doi.org\/10.1109\/TCYB.2020.3024849","journal-title":"IEEE Trans. Cybern."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.procir.2021.11.069","volume":"104","author":"S Shady","year":"2021","unstructured":"Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: Evolving dispatching rules using genetic programming for multi-objective dynamic job shop scheduling with machine breakdowns. Procedia CIRP 104, 411\u2013416 (2021). https:\/\/doi.org\/10.1016\/j.procir.2021.11.069","journal-title":"Procedia CIRP"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s40747-017-0036-x","volume":"3","author":"S Nguyen","year":"2017","unstructured":"Nguyen, S., Mei, Y., Zhang, M.: Genetic programming for production scheduling: a survey with a unified framework. Complex Intell. Syst. 3, 41\u201366 (2017). https:\/\/doi.org\/10.1007\/s40747-017-0036-x","journal-title":"Complex Intell. Syst."},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: Exploring hyper-heuristic methodologies with genetic programming. In: Mumford, C.L., Jain, L.C. (eds.) Computational Intelligence. Intelligent Systems Reference Library, vol. 1, pp. 177\u2013201. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-642-01799-5_6","DOI":"10.1007\/978-3-642-01799-5_6"},{"key":"12_CR8","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, 763\u2013774 (2013). https:\/\/doi.org\/10.1007\/s10845-012-0626-9","journal-title":"J. Intell. Manuf."},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: Multi-objective approach with a distance metric in genetic programming for job shop scheduling. Int. J. Autom. Technol. 16, 296\u2013308 (2022). https:\/\/doi.org\/10.20965\/ijat.2022.p0296","DOI":"10.20965\/ijat.2022.p0296"},{"key":"12_CR10","unstructured":"Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: A proposal on dispatching rule generation mechanism using GP for dynamic job shop scheduling with machine breakdowns. In: Scheduling Symposium 2020, Osaka, pp. 155\u2013160 (2020)"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: Surrogate assisted gene expression programming for automated design of job shop scheduling rules. In: 2022 Proceedings of the International Symposium on Flexible Automation, pp. 324\u2013330 (2022). https:\/\/doi.org\/10.11509\/isfa.2022.324","DOI":"10.11509\/isfa.2022.324"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"2951","DOI":"10.1109\/TCYB.2016.2562674","volume":"47","author":"S Nguyen","year":"2017","unstructured":"Nguyen, S., Zhang, M., Tan, K.C.: Surrogate-assisted genetic programming with simplified models for automated design of dispatching rules. IEEE Trans. Cybern. 47, 2951\u20132965 (2017). https:\/\/doi.org\/10.1109\/TCYB.2016.2562674","journal-title":"IEEE Trans. Cybern."},{"key":"12_CR13","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, 343\u2013367 (2015). https:\/\/doi.org\/10.1162\/EVCO_a_00133","journal-title":"Evol. Comput."},{"key":"12_CR14","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems. Curran Associates, Inc. (2017)"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Devlin, J., Chang, M.-W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding (2019). https:\/\/doi.org\/10.48550\/arXiv.1810.04805, http:\/\/arxiv.org\/abs\/1810.04805","DOI":"10.48550\/arXiv.1810.04805"},{"key":"12_CR16","unstructured":"Brown, T., et al.: Language models are few-shot learners. In: Advances in Neural Information Processing Systems, pp. 1877\u20131901. Curran Associates, Inc. (2020)"},{"key":"12_CR17","first-page":"1","volume":"21","author":"C Raffel","year":"2020","unstructured":"Raffel, C., et al.: Exploring the limits of transfer learning with a unified text-to-text transformer. J. Mach. Learn. Res. 21, 1\u201367 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Bresson, X., Laurent, T.: The transformer network for the traveling salesman problem (2021). https:\/\/doi.org\/10.48550\/arXiv.2103.03012, http:\/\/arxiv.org\/abs\/2103.03012","DOI":"10.48550\/arXiv.2103.03012"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1016\/j.ins.2022.11.073","volume":"619","author":"Q Wang","year":"2023","unstructured":"Wang, Q., Lai, K.H., Tang, C.: Solving combinatorial optimization problems over graphs with BERT-based deep reinforcement learning. Inf. Sci. 619, 930\u2013946 (2023). https:\/\/doi.org\/10.1016\/j.ins.2022.11.073","journal-title":"Inf. Sci."},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Yang, C., et al.: Large language models as optimizers (2024). https:\/\/doi.org\/10.48550\/arXiv.2309.03409, http:\/\/arxiv.org\/abs\/2309.03409","DOI":"10.48550\/arXiv.2309.03409"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"101663","DOI":"10.1016\/j.swevo.2024.101663","volume":"90","author":"S Huang","year":"2024","unstructured":"Huang, S., Yang, K., Qi, S., Wang, R.: When large language model meets optimization. Swarm Evol. Comput. 90, 101663 (2024). https:\/\/doi.org\/10.1016\/j.swevo.2024.101663","journal-title":"Swarm Evol. Comput."},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Abgaryan, H., Harutyunyan, A., Cazenave, T.: LLMs can schedule (2024). https:\/\/doi.org\/10.48550\/arXiv.2408.06993, http:\/\/arxiv.org\/abs\/2408.06993","DOI":"10.48550\/arXiv.2408.06993"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Peng, S., Yuan, K., Gao, L., Tang, Z.: MathBERT: a pre-trained model for mathematical formula understanding (2021). https:\/\/doi.org\/10.48550\/arXiv.2105.00377, http:\/\/arxiv.org\/abs\/2105.00377","DOI":"10.48550\/arXiv.2105.00377"},{"key":"12_CR24","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). https:\/\/doi.org\/10.1007\/BF02023073","journal-title":"Ann. Oper. Res."},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: Automatic design of dispatching rules with genetic programming for dynamic job shop scheduling. In: Lalic, B., Majstorovic, V., Marjanovic, U., von Cieminski, G., Romero, D. (eds.) APMS 2020. IFIP Advances in Information and Communication Technology, vol. 591, pp. 399\u2013407. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57993-7_45","DOI":"10.1007\/978-3-030-57993-7_45"}],"container-title":["IFIP Advances in Information and Communication Technology","Advances in Production Management Systems. Cyber-Physical-Human Production Systems: Human-AI Collaboration and Beyond"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-03550-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T22:04:26Z","timestamp":1756245866000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-03550-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"ISBN":["9783032035493","9783032035509"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-03550-9_12","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,27]]},"assertion":[{"value":"27 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Advances in Production Management Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kamakura","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apms2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.apms-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}