{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:17:00Z","timestamp":1743117420346,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031417733"},{"type":"electronic","value":"9783031417740"}],"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-3-031-41774-0_42","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T03:25:20Z","timestamp":1695266720000},"page":"534-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Fitness Approximation Assisted Hyper-heuristic for\u00a0the\u00a0Permutation Flowshop Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9374-0501","authenticated-orcid":false,"given":"Asma","family":"Cherrered","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2411-669X","authenticated-orcid":false,"given":"Imene Racha","family":"Mekki","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3302-7344","authenticated-orcid":false,"given":"Karima","family":"Benatchba","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7032-8544","authenticated-orcid":false,"given":"Fatima","family":"Benbouzid-Si Tayeb","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"key":"42_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101127","volume":"74","author":"I Abu Doush","year":"2022","unstructured":"Abu Doush, I., Al-Betar, M., Awadallah, M., Alyasseri, Z., Makhadmeh, S., El-Abd, M.: Island neighboring heuristics harmony search algorithm for flow shop scheduling with blocking. Swarm Evol. Comput. 74, 101127 (2022)","journal-title":"Swarm Evol. Comput."},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"3517","DOI":"10.1007\/s11227-021-03998-9","volume":"78","author":"N Alawad","year":"2022","unstructured":"Alawad, N., Abed-alguni, B.: Discrete Jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem. J. Supercomput 78, 3517\u20133538 (2022)","journal-title":"J. Supercomput"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Bacha, S.Z.A., Belahdji, M.W., Benatchba, K., Tayeb, F.B.S.: A new hyperheuristic to generate effective instance GA for the permutation flow shop problem, Procedia Comput. Sci. 159, 1365\u20131374 (2019). http:\/\/dx.doi.org\/10.1016\/j.procs.2019.09.307. Knowledge-Based and Intelligent Information and Engineering Systems: Proceedings of the 23rd International Conference KES2019 (2019)","DOI":"10.1016\/j.procs.2019.09.307"},{"key":"42_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109079","volume":"124","author":"SZA Bacha","year":"2022","unstructured":"Bacha, S.Z.A., Benatchba, K., Tayeb, F.B.S.: Adaptive search space to generate a per-instance genetic algorithm for the permutation flow shop problem. Appl. Soft Comput. 124, 109079 (2022)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"42_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Kendall, G., M\u0131s\u0131r, M., zcan, E. O.: Monte Carlo hyper-heuristics for examination timetabling, Ann. Oper. Res. 196(1) 73\u201390 (2012)","DOI":"10.1007\/s10479-010-0782-2"},{"key":"42_CR7","doi-asserted-by":"publisher","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":"42_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108276","volume":"169","author":"V Fernandez-Viagas","year":"2022","unstructured":"Fernandez-Viagas, V., Prata, B., Framinan, J.: A critical-path based iterated local search for the green permutation flowshop problem. Comput. Ind. Eng. 169, 108276 (2022)","journal-title":"Comput. Ind. Eng."},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","volume":"257","author":"V Fernandez-Viagas","year":"2017","unstructured":"Fernandez-Viagas, V., Ruiz, R., Framinan, J.M.: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation. Eur. J. Oper. Res. 257, 707\u2013721 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.ejor.2021.10.001","volume":"299","author":"V Fernandez-Viagas","year":"2022","unstructured":"Fernandez-Viagas, V., Talens, C., Framinan, J.: Assembly flowshop scheduling problem: speed-up procedure and computational evaluation. Eur. J. Oper. Res. 299, 869\u2013882 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"42_CR11","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(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Foundations of Genetic Algorithms, vol. 1, pp. 69\u201393. Elsevier (1991)","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"issue":"2","key":"42_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A.M., Talbi, E.G.: Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art. Eur. J. Oper. Res. 296(2), 393\u2013422 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR14","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-85672-4_4","volume-title":"Optimization and Learning","author":"M Karimi-Mamaghan","year":"2021","unstructured":"Karimi-Mamaghan, M., Pasdeloup, B., Mohammadi, M., Meyer, P.: A learning-based iterated local search algorithm for solving the traveling salesman problem. In: Dorronsoro, B., Amodeo, L., Pavone, M., Ruiz, P. (eds.) OLA 2021. CCIS, vol. 1443, pp. 45\u201361. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85672-4_4"},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"2346","DOI":"10.1080\/00207543.2021.1887533","volume":"60","author":"JH Lee","year":"2022","unstructured":"Lee, J.H., Kim, H.J.: Reinforcement learning for robotic flow shop scheduling with processing time variations. Int. J. Prod. Res. 60, 2346\u20132368 (2022)","journal-title":"Int. J. Prod. Res."},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/TEVC.2009.2027359","volume":"14","author":"D Lim","year":"2009","unstructured":"Lim, D., Jin, Y., Ong, Y.-S., Sendhoff, B.: Generalizing surrogate-assisted evolutionary computation. IEEE Trans. Evol. Comput. 14, 329\u2013355 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"42_CR17","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.cie.2015.04.009","volume":"85","author":"Q Lin","year":"2015","unstructured":"Lin, Q., Gao, L., Li, X., Zhang, C.: A hybrid backtracking search algorithm for permutation flow-shop scheduling problem. Comput. Ind. Eng. 85, 437\u2013446 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"42_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.107956","volume":"166","author":"M Morais","year":"2022","unstructured":"Morais, M., Ribeiro, M., da Silva, R., Mariani, V., Coelho, L.: Discrete differential evolution metaheuristics for permutation flow shop scheduling problems. Comput. Ind. Eng. 166, 107956 (2022)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"42_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF03024314","volume":"18","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z., Hartley, S.J.: Genetic algorithms+ data structures= evolution programs. Math. Intell. 18(3), 71 (1996)","journal-title":"Math. Intell."},{"issue":"2","key":"42_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0925-5273(03)00184-1","volume":"88","author":"AC Nearchou","year":"2004","unstructured":"Nearchou, A.C.: The effect of various operators on the genetic search for large scheduling problems. Int. J. Prod. Econ. 88(2), 191\u2013203 (2004)","journal-title":"Int. J. Prod. Econ."},{"key":"42_CR21","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.12.006","volume":"70","author":"J Neufeld","year":"2016","unstructured":"Neufeld, J., Gupta, J., Buscher, U.: A comprehensive review of flowshop group scheduling literature. Comput. Oper. Res. 70, 56\u201374 (2016)","journal-title":"Comput. Oper. Res."},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Nugraheni, C.E., Abednego, L.: A tabu-search based constructive hyper-heuristics for scheduling problems in textile industry. J. Ind. Intell. Inf. 5(2) (2017)","DOI":"10.18178\/jiii.5.2.23-27"},{"key":"42_CR23","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.ins.2018.06.027","volume":"463","author":"V Pandiri","year":"2018","unstructured":"Pandiri, V., Singh, A.: A hyper-heuristic based artificial bee colony algorithm for k-interconnected multi-depot multi-traveling salesman problem. Inf. Sci. 463, 261\u2013281 (2018)","journal-title":"Inf. Sci."},{"key":"42_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz, R., Pan, Q.K., Naderi, B.: Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega 83, 213\u2013222 (2019)","journal-title":"Omega"},{"issue":"5","key":"42_CR25","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R Ruiz","year":"2006","unstructured":"Ruiz, R., Maroto, C., Alcaraz, J.: Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34(5), 461\u2013476 (2006)","journal-title":"Omega"},{"issue":"2","key":"42_CR26","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13748-019-00185-z","volume":"8","author":"H Song","year":"2019","unstructured":"Song, H., Triguero, I., \u00d6zcan, E.: A review on the self and dual interactions between machine learning and optimisation. Prog. Artif. Intell. 8(2), 143\u2013165 (2019). https:\/\/doi.org\/10.1007\/s13748-019-00185-z","journal-title":"Prog. Artif. Intell."},{"issue":"1","key":"42_CR27","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2014.03.046","volume":"238","author":"JA Soria-Alcaraz","year":"2014","unstructured":"Soria-Alcaraz, J.A., Ochoa, G., Swan, J., Carpio, M., Puga, H., Burke, E.K.: Effective learning hyper-heuristics for the course timetabling problem. Eur. J. Oper. Res. 238(1), 77\u201386 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR28","doi-asserted-by":"crossref","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993). ISSN 0377\u20132217","DOI":"10.1016\/0377-2217(93)90182-M"},{"issue":"1","key":"42_CR29","first-page":"1","volume":"8","author":"A Tanzila","year":"2021","unstructured":"Tanzila, A., Asif, A.S.: A comparative analysis of heuristic metaheuristic and exact approach to minimize make span of permutation flow shop scheduling. Am. J. Ind. Eng. 8(1), 1\u20138 (2021)","journal-title":"Am. J. Ind. Eng."},{"key":"42_CR30","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1016\/j.cor.2013.01.005","volume":"40","author":"FM Tasgetiren","year":"2013","unstructured":"Tasgetiren, F.M., Pan, Q.K., Suganthan, P.N., Buyukdagli, O.: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Comput. Oper. Res. 40, 1729\u20131743 (2013)","journal-title":"Comput. Oper. Res."},{"key":"42_CR31","doi-asserted-by":"crossref","unstructured":"Tong, H., Huang, C., Minku, L.L., Yao, X.: Surrogate models in evolutionary single-objective optimization: a new taxonomy and experimental study. Inf. Sci. 562 414\u2013437 (2021)","DOI":"10.1016\/j.ins.2021.03.002"},{"key":"42_CR32","unstructured":"Wilson, J.: Search methodologies: introductory tutorials in optimization and decision support techniques (2007)"},{"issue":"1","key":"42_CR33","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Communications in Computer and Information Science","Advances in Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41774-0_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T06:35:24Z","timestamp":1695278124000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41774-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031417733","9783031417740"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41774-0_42","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Budapest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"218","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":"59","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":"27% - 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.01","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":"1.86","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)"}}]}}