{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T22:01:36Z","timestamp":1769292096510,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030917012","type":"print"},{"value":"9783030917029","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-91702-9_11","type":"book-chapter","created":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T20:02:46Z","timestamp":1638043366000},"page":"155-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Learning in Hyper-Heuristics to Solve Flowshop Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5622-392X","authenticated-orcid":false,"given":"Lucas Marcondes","family":"Pavelski","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4372-5162","authenticated-orcid":false,"given":"Marie-\u00c9l\u00e9onore","family":"Kessaci","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2791-174X","authenticated-orcid":false,"given":"Myriam","family":"Delgado","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,28]]},"reference":[{"key":"11_CR1","unstructured":"Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. J. Mach. Learn. Res. 3(9), 397\u2013422 (2002)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Baker, K.R., Trietsch, D.: Principles of Sequencing and Scheduling. Wiley Publishing, New Jersey USA (2009)","DOI":"10.1002\/9780470451793"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Burcin, O.F., Sagir, M.: Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant. Comput. Oper. Res. 125, 105044 (2021). https:\/\/doi.org\/10.1016\/j.cor.2020.105044","DOI":"10.1016\/j.cor.2020.105044"},{"key":"11_CR4","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-319-91086-4_14","volume-title":"Handbook of Metaheuristics","author":"EK Burke","year":"2019","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches: revisited. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 453\u2013477. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_14"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Chakhlevitch, K., Cowling, P.: Hyperheuristics: recent developments. In: Studies in Computational Intelligence, vol. 136, pp. 3\u201329. Springer, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79438-7_1","DOI":"10.1007\/978-3-540-79438-7_1"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.cor.2016.12.021","volume":"81","author":"J Dubois-Lacoste","year":"2017","unstructured":"Dubois-Lacoste, J., Pagnozzi, F., St\u00fctzle, T.: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem. Comput. Oper. Res. 81, 160\u2013166 (2017). https:\/\/doi.org\/10.1016\/j.cor.2016.12.021","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1023\/A:1022681708029","volume":"5","author":"DE Goldberg","year":"1990","unstructured":"Goldberg, D.E.: Probability matching, the magnitude of reinforcement, and classifier system Bidding. Mach. Learn. 5(4), 407\u2013425 (1990). https:\/\/doi.org\/10.1023\/A:1022681708029","journal-title":"Mach. Learn."},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Gupta, N., Granmo, O.C., Agrawala, A.: Thompson sampling for dynamic multi-armed bandits. In: 2011 10th International Conference on Machine Learning and Applications and Workshops, pp. 484\u2013489. IEEE, Honolulu, HI, USA (2011). https:\/\/doi.org\/10.1109\/ICMLA.2011.144","DOI":"10.1109\/ICMLA.2011.144"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Humeau, J., Liefooghe, A., Talbi, E.G., Verel, S.: ParadisEO-MO: From Fitness Landscape Analysis to Efficient Local Search Algorithms. Research Report RR-7871, INRIA (2013)","DOI":"10.1007\/s10732-013-9228-8"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 27(1), 3\u201345 (2019)","journal-title":"Evol. Comput."},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/TEVC.2013.2239648","volume":"18","author":"K Li","year":"2014","unstructured":"Li, K., Fialho, A., Kwong, S., Zhang, Q.: Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 18(1), 114\u2013130 (2014). https:\/\/doi.org\/10.1109\/TEVC.2013.2239648","journal-title":"IEEE Trans. Evol. Comput."},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Li, L., Chu, W., Langford, J., Schapire, R.E.: A contextual-bandit approach to personalized news article recommendation. In: Proceedings of the 19th International Conference on World Wide Web - WWW \u201910, p. 661. ACM Press, Raleigh, North Carolina, USA (2010). https:\/\/doi.org\/10.1145\/1772690.1772758","DOI":"10.1145\/1772690.1772758"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., St\u00fctzle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper. Res. Perspect."},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10710-013-9186-9","volume":"15","author":"GL Pappa","year":"2013","unstructured":"Pappa, G.L., Ochoa, G., Hyde, M.R., Freitas, A.A., Woodward, J., Swan, J.: Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms. Genetic Program. Evolvable Mach. 15(1), 3\u201335 (2013). https:\/\/doi.org\/10.1007\/s10710-013-9186-9","journal-title":"Genetic Program. Evolvable Mach."},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Pillay, N., Qu, R.: Hyper-heuristics: theory and applications. Springer Nature, 1 edn. (2018). https:\/\/doi.org\/10.1007\/978-3-319-96514-7","DOI":"10.1007\/978-3-319-96514-7"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Hsiao, P.-C., Chiang, T.-C., Fu, L.-C.: A VNS-based hyper-heuristic with adaptive computational budget of local search. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE, Brisbane, Australia (2012). https:\/\/doi.org\/10.1109\/CEC.2012.6252969","DOI":"10.1109\/CEC.2012.6252969"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Pitzer, E., Affenzeller, M.: Recent Advances in Intelligent Engineering Systems. Studies in Computational Intelligence, vol. 378, chap. A Comprehensive Survey on Fitness Landscape Analysis, pp. 161\u2013186. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-23229-9","DOI":"10.1007\/978-3-642-23229-9"},{"issue":"3","key":"11_CR18","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033\u20132049 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2005.12.009","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR19","unstructured":"Russo, D., Van Roy, B., Kazerouni, A., Osband, I., Wen, Z.: A Tutorial on Thompson Sampling. arXiv:1707.02038 [cs] (2020)"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Sapkal, S.U., Laha, D.: A heuristic for no-wait flow shop scheduling. Int. J. Adv. Manuf. Technol. 1, 1327\u20131338 (2013). https:\/\/doi.org\/10.1007\/s00170-013-4924-y","DOI":"10.1007\/s00170-013-4924-y"},{"key":"11_CR21","unstructured":"St\u00fctzle, T.: Applying iterated local search to the permutation flow shop problem. Technical report, FG Intellektik, TU Darmstadt, Darmstadt, Germany (1998)"},{"key":"11_CR22","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. Adaptive Computation and Machine Learning Series. 2nd edn. The MIT Press, Cambridge, Massachusetts (2018)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Tasgetiren, M.F., Pan, Q.K., Suganthan, P.N., Liang, Y.C.: A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flowtime criterion. In: 2007 IEEE Symposium on Computational Intelligence in Scheduling, pp. 251\u2013258. IEEE, Honolulu, USA (2007)","DOI":"10.1109\/SCIS.2007.367698"},{"key":"11_CR24","unstructured":"Watson, J.P., Barbulescu, L., Howe, A.E., Whitley, L.D.: Algorithm performance and problem structure for flow-shop scheduling. In: AAAI\/IAAI, pp. 688\u2013695. American Association for Artificial Intelligence, Menlo Park, CA, USA (1999)"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.procs.2015.08.199","volume":"60","author":"H Yahyaoui","year":"2015","unstructured":"Yahyaoui, H., Krichen, S., Derbel, B., Talbi, E.G.: A hybrid ILS-VND based hyper-heuristic for permutation flowshop scheduling problem. Procedia Comput. Sci. 60, 632\u2013641 (2015). https:\/\/doi.org\/10.1016\/j.procs.2015.08.199","journal-title":"Procedia Comput. Sci."},{"issue":"5\u20136","key":"11_CR26","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s00170-004-2223-3","volume":"27","author":"L Zhang","year":"2006","unstructured":"Zhang, L., Wang, L., Zheng, D.Z.: An adaptive genetic algorithm with multiple operators for flowshop scheduling. Int. J. Adv. Manuf. Technol. 27(5\u20136), 580\u2013587 (2006). https:\/\/doi.org\/10.1007\/s00170-004-2223-3","journal-title":"Int. J. Adv. Manuf. Technol."}],"container-title":["Lecture Notes in Computer Science","Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91702-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:03:00Z","timestamp":1709812980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91702-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030917012","9783030917029"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91702-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BRACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Conference on Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bracis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/c4ai.inova.usp.br\/bracis\/","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":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"192","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":"77","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":"40% - 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":"3.1","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)"}},{"value":"Due to COVID-19, the conference was held as an online event.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}