{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:09:19Z","timestamp":1774555759659,"version":"3.50.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Humanidades, Ciencias y Tecnolog\u00edas","doi-asserted-by":"crossref","award":["287479"],"award-info":[{"award-number":["287479"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10951-024-00819-8","type":"journal-article","created":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T13:01:54Z","timestamp":1728910914000},"page":"85-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance?"],"prefix":"10.1007","volume":"28","author":[{"given":"Fernando","family":"Garza-Santisteban","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4494-7864","authenticated-orcid":false,"given":"Jorge Mario","family":"Cruz-Duarte","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8821-7137","authenticated-orcid":false,"given":"Ivan","family":"Amaya","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3408-2166","authenticated-orcid":false,"given":"Jos\u00e9 Carlos","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6270-3164","authenticated-orcid":false,"given":"Santiago Enrique","family":"Conant-Pablos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-0773","authenticated-orcid":false,"given":"Hugo","family":"Terashima-Mar\u00edn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,14]]},"reference":[{"issue":"3","key":"819_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391\u2013401.","journal-title":"Management Science"},{"key":"819_CR2","doi-asserted-by":"crossref","unstructured":"Amaya, I., Ortiz-Bayliss, J. C., Conant-Pablos, S., & Terashima-Marin, H. (2019). Hyper-heuristics reversed: Learning to combine solvers by evolving instances. In 2019 IEEE congress on evolutionary computation (CEC). IEEE.","DOI":"10.1109\/CEC.2019.8789928"},{"issue":"2","key":"819_CR3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MCI.2018.2807018","volume":"13","author":"I Amaya","year":"2018","unstructured":"Amaya, I., Ortiz-Bayliss, J. C., Rosales-P\u00e9rez, A., Guti\u00e9rrez-Rodr\u00edguez, A. E., Conant-Pablos, S. E., Terashima-Mar\u00edn, H., & Coello Coello, C. A. (2018). Enhancing selection hyper-heuristics via feature transformations. IEEE Computational Intelligence Magazine, 13(2), 30\u201341.","journal-title":"IEEE Computational Intelligence Magazine"},{"key":"819_CR4","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., & Protasi, M. (2012). Complexity and approximation: Combinatorial optimization problems and their approximability properties. Springer. https:\/\/books.google.com.mx\/books?id=8j6qCAAAQBAJ"},{"key":"819_CR5","doi-asserted-by":"crossref","unstructured":"Bai, R., & Kendall, G.(2005). An investigation of automated planograms using a simulated annealing based hyper-heuristic. In Metaheuristics: Progress as real problem solvers (pp. 87\u2013108). Springer.","DOI":"10.1007\/0-387-25383-1_4"},{"issue":"1","key":"819_CR6","doi-asserted-by":"crossref","first-page":"386","DOI":"10.2514\/1.J059176","volume":"59","author":"SK Barman","year":"2021","unstructured":"Barman, S. K., Maiti, D. K., & Maity, D. (2021). Vibration-based delamination detection in composite structures employing mixed unified particle swarm optimization. AIAA Journal, 59(1), 386\u2013399.","journal-title":"AIAA Journal"},{"key":"819_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207548208947745","volume":"20","author":"H Blackstone","year":"1982","unstructured":"Blackstone, H., T.\u00a0Phillips, J., & Hogg, G, D. (1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20, 27\u201345.","journal-title":"International Journal of Production Research"},{"key":"819_CR8","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.cie.2017.09.042","volume":"113","author":"W Bozejko","year":"2017","unstructured":"Bozejko, W., Gnatowski, A., Pempera, J., & Wodecki, M. (2017). Parallel tabu search for the cyclic job shop scheduling problem. Computers & Industrial Engineering, 113, 512\u2013524.","journal-title":"Computers & Industrial Engineering"},{"key":"819_CR9","unstructured":"Bratley, P., Fox, B. L., & Schrage, L. E. (2011). A guide to simulation. Springer."},{"issue":"1","key":"819_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P Brucker","year":"1994","unstructured":"Brucker, P., Jurisch, B., & Sievers, B. (1994). A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49(1), 107\u2013127. https:\/\/doi.org\/10.1016\/0166-218X(94)90204-6","journal-title":"Discrete Applied Mathematics"},{"key":"819_CR11","doi-asserted-by":"publisher","unstructured":"Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., & Schulenburg, S. (2003). Hyper-heuristics: An emerging direction in modern search technology (pp. 457\u2013474). Springer. https:\/\/doi.org\/10.1007\/0-306-48056-5_16","DOI":"10.1007\/0-306-48056-5_16"},{"issue":"12","key":"819_CR12","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., & Qu, R. (2013). Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12), 1695\u20131724.","journal-title":"Journal of the Operational Research Society"},{"key":"819_CR13","doi-asserted-by":"crossref","unstructured":"Chaurasia, S. N., Sundar, S., Jung, D., Lee, H. M., & Kim, J. H. (2019). An evolutionary algorithm based hyper-heuristic for the job-shop scheduling problem with no-wait constraint. In Harmony search and nature inspired optimization algorithms (vol. 741, pp. 249\u2013257). Springer.","DOI":"10.1007\/978-981-13-0761-4_25"},{"key":"819_CR14","doi-asserted-by":"crossref","unstructured":"Chong, C. S., Low, M. Y. H., Sivakumar, A. I., & Gay, K. L. (2006). A bee colony optimization algorithm to job shop scheduling. In Proceedings of the 2006 winter simulation conference (pp. 1954\u20131961). Winter Simulatrion Conference, Monterey,California.","DOI":"10.1109\/WSC.2006.322980"},{"issue":"1","key":"819_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc, M., & Kennedy, J. (2002). The particle swarm: Explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1), 58\u201373. https:\/\/doi.org\/10.1109\/4235.985692","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"5","key":"819_CR16","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1111\/itor.12195.","volume":"24","author":"MA Cruz-Ch\u00e1vez","year":"2017","unstructured":"Cruz-Ch\u00e1vez, M. A., Mart\u00ednez-Rangel, M. G., & Cruz-Rosales, M. H. (2017). Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem. International Transactions in Operational Research, 24(5), 1119\u20131137. https:\/\/doi.org\/10.1111\/itor.12195.","journal-title":"International Transactions in Operational Research"},{"key":"819_CR17","doi-asserted-by":"publisher","unstructured":"Cruz-Duarte, J. M., Amaya, I., Ortiz-Bayliss, J. C., Conant-Pablos, S. E., Terashima-Mar\u00edn, H., & Shi, Y. (2021). Hyper-heuristics to customise metaheuristics for continuous optimisation. Swarm Evol. Comput. p. 100935 https:\/\/doi.org\/10.1016\/j.swevo.2021.100935. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650221000961","DOI":"10.1016\/j.swevo.2021.100935"},{"issue":"11","key":"819_CR18","doi-asserted-by":"publisher","first-page":"2046","DOI":"10.3390\/math8112046","volume":"8","author":"JM Cruz-Duarte","year":"2020","unstructured":"Cruz-Duarte, J. M., Ortiz-Bayliss, J. C., Amaya, I., Shi, Y., Terashima-Mar\u00edn, H., & Pillay, N. (2020). Towards a generalised metaheuristic model for continuous optimisation problems. Mathematics, 8(11), 2046. https:\/\/doi.org\/10.3390\/math8112046","journal-title":"Mathematics"},{"key":"819_CR19","doi-asserted-by":"publisher","unstructured":"Delahaye, D., Chaimatanan, S., & Mongeau, M. (2019). Simulated annealing: From basics to applications. In M.\u00a0Gendreau, J. Y. Potvin (eds.) Handb. Metaheuristics, third edn., chap.\u00a01, pp. 1\u201335. Springer https:\/\/doi.org\/10.1007\/978-3-319-91086-4_1.","DOI":"10.1007\/978-3-319-91086-4_1"},{"issue":"10","key":"819_CR20","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1016\/j.cor.2011.12.005","volume":"39","author":"RQ dao-er ji","year":"2012","unstructured":"dao-er ji, R. Q., & Wang, Y. (2012). A new hybrid genetic algorithm for job shop scheduling problem. Computers & Operations Research, 39(10), 2291\u20132299.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"819_CR21","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073.","volume":"285","author":"JH Drake","year":"2020","unstructured":"Drake, J. H., Kheiri, A., \u00d6zcan, E., & Burke, E. K. (2020). Recent advances in selection hyper-heuristics. European Journal of Operational Research, 285(2), 405\u2013428. https:\/\/doi.org\/10.1016\/j.ejor.2019.07.073.https:\/\/doi.org\/10.1016\/j.ejor.2019.07.073 linkinghub.elsevier.com\/retrieve\/pii\/S0377221719306526.","journal-title":"European Journal of Operational Research"},{"key":"819_CR22","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.cie.2017.08.005","volume":"111","author":"A Elmi","year":"2017","unstructured":"Elmi, A., & Topaloglu, S. (2017). Cyclic job shop robotic cell scheduling problem: Ant colony optimization. Computers & Industrial Engineering, 111, 417\u2013432. https:\/\/doi.org\/10.1016\/j.cie.2017.08.005","journal-title":"Computers & Industrial Engineering"},{"key":"819_CR23","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.cie.2018.11.006","volume":"127","author":"K Fan","year":"2019","unstructured":"Fan, K., Wang, M., Zhai, Y., & Li, X. (2019). Scatter search algorithm for the multiprocessor task job-shop scheduling problem. Computers & Industrial Engineering, 127, 677\u2013686. https:\/\/doi.org\/10.1016\/j.cie.2018.11.006","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"819_CR24","first-page":"13","volume":"3","author":"P Fattahi","year":"2018","unstructured":"Fattahi, P., Messi Bidgoli, M., & Samouei, P. (2018). An improved tabu search algorithm for job shop scheduling problem trough hybrid solution representations. Journal of Quality Engineering and Production Optimization, 3(1), 13\u201326.","journal-title":"Journal of Quality Engineering and Production Optimization"},{"issue":"2","key":"819_CR25","doi-asserted-by":"crossref","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. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"819_CR26","doi-asserted-by":"publisher","unstructured":"Garza-Santisteban, F., Cruz-Duarte, J. M., Amaya, I., Ortiz-Bayliss, J. C., Enrique Conant-Pablos, S., & Terashima-Mar\u00edn, H.(2019). Influence of instance size on selection hyper-heuristics for job shop scheduling problems. In 2019 IEEE Symposium Series on Computational Intelligence (SSCI) (pp. 1708\u20131715). https:\/\/doi.org\/10.1109\/SSCI44817.2019.9002653","DOI":"10.1109\/SSCI44817.2019.9002653"},{"key":"819_CR27","doi-asserted-by":"crossref","unstructured":"Garza-Santisteban, F., Sanchez-Pamanes, R., Puente-Rodriguez, L. A., Amaya, I., Ortiz-Bayliss, J. C., Conant-Pablos, S., & Terashima-Marin, H. (2019). A simulated annealing hyper-heuristic for job shop scheduling problems. In 2019 IEEE congress on evolutionary computation (CEC) (pp. 57\u201364). IEEE.","DOI":"10.1109\/CEC.2019.8790296"},{"issue":"4","key":"819_CR28","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1162\/EVCO_a_00183","volume":"24","author":"E Hart","year":"2016","unstructured":"Hart, E., & Sim, K. (2016). A hyper-heuristic ensemble method for static job-shop scheduling. Evolutionary Computation, 24(4), 609\u2013635.","journal-title":"Evolutionary Computation"},{"issue":"2","key":"819_CR29","doi-asserted-by":"crossref","first-page":"2061","DOI":"10.1007\/s10706-019-01148-w","volume":"38","author":"N Himanshu","year":"2020","unstructured":"Himanshu, N., Burman, A., & Kumar, V. (2020). Assessment of optimum location of non-circular failure surface in soil slope using unified particle swarm optimization. Geotechnical and Geological Engineering, 38(2), 2061\u20132083.","journal-title":"Geotechnical and Geological Engineering"},{"issue":"4","key":"819_CR30","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1016\/j.cor.2006.07.003","volume":"35","author":"KL Huang","year":"2008","unstructured":"Huang, K. L., & Liao, C. J. (2008). Ant colony optimization combined with taboo search for the job shop scheduling problem. Computers & Operations Research, 35(4), 1030\u20131046.","journal-title":"Computers & Operations Research"},{"issue":"12","key":"819_CR31","doi-asserted-by":"crossref","first-page":"2279","DOI":"10.1007\/s00500-013-1096-5","volume":"17","author":"M Kalender","year":"2013","unstructured":"Kalender, M., Kheiri, A., \u00d6zcan, E., & Burke, E. K. (2013). A greedy gradient-simulated annealing selection hyper-heuristic. Soft Computing, 17(12), 2279\u20132292.","journal-title":"Soft Computing"},{"issue":"4598","key":"819_CR32","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671\u2013680.","journal-title":"Science"},{"key":"819_CR33","doi-asserted-by":"publisher","unstructured":"Klusch, M., Pechoucek, M., & Polleres, A. (2006). Artificial intelligence: Methodology, systems, and applications. In Artificial Intelligence: Methodology, Systems, and Applications, Lecture Notes in Computer Science, vol. 4183. Springer Berlin Heidelberg, Berlin, Heidelberg https:\/\/doi.org\/10.1007\/11861461","DOI":"10.1007\/11861461"},{"key":"819_CR34","doi-asserted-by":"crossref","unstructured":"Kumar, V., et\u00a0al. (2019). Integration of dispatch rules for jssp: A learning approach. In Soft computing: Theories and applications (pp. 619\u2013627). Springer.","DOI":"10.1007\/978-981-13-0589-4_57"},{"issue":"2016","key":"819_CR35","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.engappai.2018.10.008","volume":"77","author":"J Lin","year":"2019","unstructured":"Lin, J. (2019). Backtracking search based hyper-heuristic for the flexible job-shop scheduling problem with fuzzy processing time. Engineering Applications of Artificial Intelligence, 77(2016), 186\u2013196.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"819_CR36","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1287\/trsc.1100.0332","volume":"45","author":"SQ Liu","year":"2010","unstructured":"Liu, S. Q., & Kozan, E. (2010). Scheduling trains with priorities: A no-wait blocking parallel-machine job-shop scheduling model. Transportation Science, 45, 147\u2013284. https:\/\/doi.org\/10.1287\/trsc.1100.0332","journal-title":"Transportation Science"},{"key":"819_CR37","doi-asserted-by":"publisher","unstructured":"Malitsky, Y., & Sellmann, M.(2012). Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. In: N.\u00a0Beldiceanu, N.\u00a0Jussien, \u00c9.\u00a0Pinson (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2012. Lecture Notes in Computer Science, pp. 244\u2013259. Springer Berlin Heidelberg, Berlin, Heidelberg https:\/\/doi.org\/10.1007\/978-3-642-29828-8_16","DOI":"10.1007\/978-3-642-29828-8_16"},{"key":"819_CR38","doi-asserted-by":"crossref","unstructured":"Masood, A., Mei, Y., Chen, G., & Zhang, M. (2016). Many-objective genetic programming for job-shop scheduling. In 2016 IEEE congress on evolutionary computation (CEC) (pp. 209\u2013216). IEEE, Vancouver, Canada.","DOI":"10.1109\/CEC.2016.7743797"},{"key":"819_CR39","unstructured":"Miles, K. S., James, R. J. W., Giffin, J. W., & Tu, Y. (2009). A knowledge discovery approach to understanding relationships between scheduling problem structure and heuristic performance. In LION."},{"key":"819_CR40","doi-asserted-by":"publisher","unstructured":"Mirshekarian, S., & \u0160ormaz, D. N. (2016). Correlation of job-shop scheduling problem features with scheduling efficiency. Expert Systems with Applications, 62, 131\u2013147. https:\/\/doi.org\/10.1016\/j.eswa.2016.06.014","DOI":"10.1016\/j.eswa.2016.06.014"},{"key":"819_CR41","unstructured":"Miyashita, K. (2000). Job-shop scheduling with genetic programming. In Proceedings of the 2nd annual conference on genetic and evolutionary computation, GECCO\u201900 (pp. 505\u2013512). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA."},{"key":"819_CR42","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.ins.2015.05.010","volume":"317","author":"MA Mu\u00f1oz","year":"2015","unstructured":"Mu\u00f1oz, M. A., Sun, Y., Kirley, M., & Halgamuge, S. K. (2015). Algorithm selection for black-box continuous optimization problems: A survey on methods and challenges. Information Sciences, 317, 224\u2013245. https:\/\/doi.org\/10.1016\/j.ins.2015.05.010","journal-title":"Information Sciences"},{"issue":"2","key":"819_CR43","doi-asserted-by":"publisher","first-page":"261","DOI":"10.2478\/amcs-2019-0019","volume":"29","author":"Y Ngoko","year":"2019","unstructured":"Ngoko, Y., C\u00e9rin, C., & Trystram, D. (2019). Solving sat in a distributed cloud: A portfolio approach. International Journal of Applied Mathematics and Computer Science, 29(2), 261\u2013274. https:\/\/doi.org\/10.2478\/amcs-2019-0019","journal-title":"International Journal of Applied Mathematics and Computer Science"},{"key":"819_CR44","doi-asserted-by":"crossref","unstructured":"Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2019). Genetic programming for job shop scheduling. In Evolutionary and swarm intelligence algorithms (pp. 143\u2013167). Springer, Cham, Switzerland.","DOI":"10.1007\/978-3-319-91341-4_8"},{"key":"819_CR45","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Hyde, M., Curtois, T., Vazquez-Rodriguez, J. A., Walker, J., Gendreau, M., Kendall, G., McCollum, B., Parkes, A. J., Petrovic, S., & Burke, E. K. (2012). Hyflex: A benchmark framework for cross-domain heuristic search. In J. K. Hao & M. Middendorf (Eds.), Evolutionary Computation in Combinatorial Optimization (pp. 136\u2013147). Springer.","DOI":"10.1007\/978-3-642-29124-1_12"},{"key":"819_CR46","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., & O\u2019Sullivan, B. (2008). Using case-based reasoning in an algorithm portfolio for constraint solving. In Irish conference on artificial intelligence and cognitive science (pp. 210\u2013216). Cork City, Ireland."},{"key":"819_CR47","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10462-016-9466-x","volume":"46","author":"J Ort\u00edz-Bayliss","year":"2016","unstructured":"Ort\u00edz-Bayliss, J., Terashima-Mar\u00edn, H., & Conant-Pablos, S. E. (2016). Combine and conquer: An evolutionary hyper-heuristic approach for solving constraint satisfaction problems. Artificial Intelligence Review, 46, 327\u2013349.","journal-title":"Artificial Intelligence Review"},{"key":"819_CR48","doi-asserted-by":"publisher","unstructured":"Parsopoulos, K., & Vrahatis, M. (2019). UPSO: A unified particle swarm optimization scheme. In International conference of computational methods in sciences and engineering 2004 (ICCMSE 2004) 1(January), 868\u2013873 https:\/\/doi.org\/10.1201\/9780429081385-222","DOI":"10.1201\/9780429081385-222"},{"key":"819_CR49","doi-asserted-by":"crossref","unstructured":"Pillay, N., & Qu, R. (2018). Hyper-heuristics: Theory and applications, natural computing series. Springer.","DOI":"10.1007\/978-3-319-96514-7"},{"issue":"2","key":"819_CR50","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MCI.2020.2976182","volume":"15","author":"R Qu","year":"2020","unstructured":"Qu, R., Kendall, G., & Pillay, N. (2020). The general combinatorial optimization problem: Towards automated algorithm design. IEEE Computational Intelligence Magazine, 15(2), 14\u201323. https:\/\/doi.org\/10.1109\/MCI.2020.2976182","journal-title":"IEEE Computational Intelligence Magazine"},{"key":"819_CR51","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3009318","author":"M Sanchez","year":"2020","unstructured":"Sanchez, M., Cruz-Duarte, J. M., Ortiz-Bayliss, J. C., Ceballos, H., Terashima-Marin, H., & Amaya, I. (2020). A systematic review of hyper-heuristics on combinatorial optimization problems. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2020.3009318","journal-title":"IEEE Access"},{"issue":"4","key":"819_CR52","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.cie.2006.09.002","volume":"51","author":"D Sha","year":"2006","unstructured":"Sha, D., & Hsu, C. Y. (2006). A hybrid particle swarm optimization for job shop scheduling problem. Computers & Industrial Engineering, 51(4), 791\u2013808.","journal-title":"Computers & Industrial Engineering"},{"issue":"06","key":"819_CR53","doi-asserted-by":"crossref","first-page":"1630001","DOI":"10.1142\/S0218213016300015","volume":"25","author":"N Siddique","year":"2016","unstructured":"Siddique, N., & Adeli, H. (2016). Simulated annealing, its variants and engineering applications. International Journal on Artificial Intelligence Tools, 25(06), 1630001.","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"819_CR54","doi-asserted-by":"publisher","first-page":"100807","DOI":"10.1016\/j.swevo.2020.100807","volume":"60","author":"HB Song","year":"2021","unstructured":"Song, H. B., & Lin, J. (2021). A genetic programming hyper-heuristic for the distributed assembly permutation flow-shop scheduling problem with sequence dependent setup times. Swarm and Evolutionary Computation, 60, 100807. https:\/\/doi.org\/10.1016\/j.swevo.2020.100807","journal-title":"Swarm and Evolutionary Computation"},{"key":"819_CR55","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100632","volume":"53","author":"C Soto","year":"2020","unstructured":"Soto, C., Dorronsoro, B., Fraire, H., Cruz-Reyes, L., Gomez-Santillan, C., & Rangel, N. (2020). Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm. Swarm and Evolutionary Computation, 53, 100632. https:\/\/doi.org\/10.1016\/j.swevo.2019.100632","journal-title":"Swarm and Evolutionary Computation"},{"issue":"2","key":"819_CR56","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278\u2013285.","journal-title":"European Journal of Operational Research"},{"key":"819_CR57","doi-asserted-by":"crossref","unstructured":"Talbi, E. (2009). Metaheuristics: From Design to Implementation. Wiley Series on Parallel and Distributed Computing. Wiley . https:\/\/books.google.com.mx\/books?id=SIsa6zi5XV8C","DOI":"10.1002\/9780470496916"},{"key":"819_CR58","doi-asserted-by":"publisher","first-page":"106264","DOI":"10.1016\/j.knosys.2020.106264","volume":"205","author":"A Turky","year":"2020","unstructured":"Turky, A., Sabar, N. R., Dunstall, S., & Song, A. (2020). Hyper-heuristic local search for combinatorial optimisation problems. Knowledge-Based Systems, 205, 106264. https:\/\/doi.org\/10.1016\/j.knosys.2020.106264","journal-title":"Knowledge-Based Systems"},{"issue":"1","key":"819_CR59","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"PJM van Laarhoven","year":"1992","unstructured":"van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992). Job shop scheduling by simulated annealing. Operations Research, 40(1), 113\u2013125.","journal-title":"Operations Research"},{"issue":"2","key":"819_CR60","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/s40436-016-0140-y","volume":"4","author":"L Wang","year":"2016","unstructured":"Wang, L., Cai, J. C., & Li, M. (2016). An adaptive multi-population genetic algorithm for job-shop scheduling problem. Advances in Manufacturing, 4(2), 142\u2013149.","journal-title":"Advances in Manufacturing"},{"issue":"6","key":"819_CR61","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","volume":"28","author":"L Wang","year":"2001","unstructured":"Wang, L., & Zheng, D. Z. (2001). An effective hybrid optimization strategy for job-shop scheduling problems. Computers & Operations Research, 28(6), 585\u2013596.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"819_CR62","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1016\/j.ejor.2019.11.055","volume":"283","author":"J Wawrzyniak","year":"2020","unstructured":"Wawrzyniak, J., Drozdowski, M., & Sanlaville, \u00c9. (2020). Selecting algorithms for large berth allocation problems. European Journal of Operational Research, 283(3), 844\u2013862. https:\/\/doi.org\/10.1016\/j.ejor.2019.11.055","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"819_CR63","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D. H., Macready, W. G., et al. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67\u201382.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"819_CR64","doi-asserted-by":"crossref","unstructured":"Wu, C. C., Bai, D., Chen, J. H., Lin, W. C., Xing, L., Lin, J. C., & Cheng, S. R. (2021). Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times. Swarm and Evolutionary Computation, 60, 100765.","DOI":"10.1016\/j.swevo.2020.100765"},{"issue":"3","key":"819_CR65","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/iet-cim.2018.0009","volume":"1","author":"J Xie","year":"2019","unstructured":"Xie, J., Gao, L., Peng, K., Li, X., & Li, H. (2019). Review on flexible job shop scheduling. IET Collaborative Intelligent Manufacturing, 1(3), 67\u201377. https:\/\/doi.org\/10.1049\/iet-cim.2018.0009","journal-title":"IET Collaborative Intelligent Manufacturing"},{"key":"819_CR66","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.swevo.2018.12.009","volume":"45","author":"G Xu","year":"2019","unstructured":"Xu, G., Cui, Q., Shi, X., Ge, H., Zhan, Z. H., Lee, H. P., Liang, Y., Tai, R., & Wu, C. (2019). Particle swarm optimization based on dimensional learning strategy. Swarm and Evolutionary Computation, 45, 33\u201351.","journal-title":"Swarm and Evolutionary Computation"},{"key":"819_CR67","doi-asserted-by":"crossref","unstructured":"Yska, D., Mei, Y., Zhang, M. (2018). Feature construction in genetic programming hyper-heuristic for dynamic flexible job shop scheduling. In Proceedings of the Genetic and Evolutionary Computation Conference Companion on - GECCO \u201918 (vol. 1, pp. 149\u2013150). ACM Press, New York, New York, USA.","DOI":"10.1145\/3205651.3205741"},{"issue":"4","key":"819_CR68","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","volume":"30","author":"J Zhang","year":"2019","unstructured":"Zhang, J., Ding, G., Zou, Y., Qin, S., & Fu, J. (2019). Review of job shop scheduling research and its new perspectives under industry 4.0. Journal of Intelligent Manufacturing, 30(4), 1809\u20131830.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"819_CR69","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/ACCESS.2018.2883802","volume":"7","author":"Y Zhou","year":"2019","unstructured":"Zhou, Y., Yang, J. J., & Zheng, L. Y. (2019). Hyper-heuristic coevolution of machine assignment and job sequencing rules for multi-objective dynamic flexible job shop scheduling. IEEE Access, 7, 68\u201388.","journal-title":"IEEE Access"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00819-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-024-00819-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00819-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T06:08:00Z","timestamp":1743487680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-024-00819-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,14]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["819"],"URL":"https:\/\/doi.org\/10.1007\/s10951-024-00819-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,14]]},"assertion":[{"value":"25 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}