{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:58:53Z","timestamp":1742947133005,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030608835"},{"type":"electronic","value":"9783030608842"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60884-2_21","type":"book-chapter","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T23:04:50Z","timestamp":1602025490000},"page":"284-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Genetic Programming Framework for Heuristic Generation for the Job-Shop Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6357-4680","authenticated-orcid":false,"given":"E.","family":"Lara-C\u00e1rdenas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2271-439X","authenticated-orcid":false,"given":"X.","family":"S\u00e1nchez-D\u00edaz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8821-7137","authenticated-orcid":false,"given":"I.","family":"Amaya","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4494-7864","authenticated-orcid":false,"given":"J. M.","family":"Cruz-Duarte","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3408-2166","authenticated-orcid":false,"given":"J. C.","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,7]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Manage. Sci. 34(3), 391\u2013401 (1988)","journal-title":"Manage. Sci."},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E Balas","year":"1998","unstructured":"Balas, E., Vazacopoulos, A.: Guided local search with shifting bottleneck for job shop scheduling. Manage. Sci. 44(2), 262\u2013275 (1998)","journal-title":"Manage. Sci."},{"key":"21_CR3","doi-asserted-by":"publisher","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.: Parallel tabu search for the cyclic job shop scheduling problem. Comput. Ind. Eng. 113, 512\u2013524 (2017). \nhttps:\/\/doi.org\/10.1016\/j.cie.2017.09.042","journal-title":"Comput. Ind. Eng."},{"key":"21_CR4","volume-title":"A Guide to Simulation","author":"P Bratley","year":"2011","unstructured":"Bratley, P., Fox, B.L., Schrage, L.E.: A Guide to Simulation. Springer Science & Business Media, Berlin (2011)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Providing a memory mechanism to enhance the evolutionary design of heuristics. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/CEC.2010.5586388"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Woodward, J.: Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1559\u20131565 (2007)","DOI":"10.1145\/1276958.1277273"},{"key":"21_CR7","series-title":"Advances in intelligent systems and computing","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-981-13-0761-4_25","volume-title":"Harmony Search and Nature Inspired Optimization Algorithms","author":"SN Chaurasia","year":"2019","unstructured":"Chaurasia, S.N., Sundar, S., Jung, D., Lee, H.M., Kim, J.H.: An evolutionary algorithm based hyper-heuristic for the job-shop scheduling problem with no-wait constraint. In: Yadav, N., Yadav, A., Bansal, J.C., Deep, K., Kim, J.H. (eds.) Harmony Search and Nature Inspired Optimization Algorithms. AISC, vol. 741, pp. 249\u2013257. Springer, Singapore (2019). \nhttps:\/\/doi.org\/10.1007\/978-981-13-0761-4_25"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Chong, C.S., Low, M.Y.H., Sivakumar, A.I., Gay, K.L.: 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 December 2006. \nhttps:\/\/doi.org\/10.1109\/WSC.2006.322980","DOI":"10.1109\/WSC.2006.322980"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176\u2013190. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44629-X_11"},{"key":"21_CR10","doi-asserted-by":"publisher","DOI":"10.21236\/AD0600965","volume-title":"Probabilistic and Parametric Learning Combinations of Local Job Shop Scheduling Rules","author":"WB Crowston","year":"1963","unstructured":"Crowston, W.B., Glover, F., Trawick, J.D., et al.: Probabilistic and Parametric Learning Combinations of Local Job Shop Scheduling Rules. Technical report, Carnegie inst of tech pittsburgh pa graduate school of industrial administration (1963)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Cruz-Duarte, J.M., Ivan, A., Ortiz-Bayliss, J.C., Conant-Pablos, S.E., Terashima-Mar\u00edn, H.: A primary study on hyper-heuristics to customise metaheuristics for continuous optimisation. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138 (2020)","DOI":"10.1109\/CEC48606.2020.9185591"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Cunha, B., Madureira, A.M., Fonseca, B., Coelho, D.: Deep reinforcement learning as a job shop scheduling solver: a literature review. In: Madureira, A.M., Abraham, A., Gandhi, N., Varela, M.L. (eds.) Hybrid Intelligent Systems, pp. 350\u2013359. Springer International Publishing, Cham (2020)","DOI":"10.1007\/978-3-030-14347-3_34"},{"key":"21_CR13","unstructured":"Fattahi, P., Messi Bidgoli, M., Samouei, P.: An improved tabu search algorithm for job shop scheduling problem trough hybrid solution representations. J. Qual Eng. Product. Optim. 3(1), 13\u201326 (2018). \nhttps:\/\/doi.org\/10.22070\/jqepo.2018.1360.1035"},{"key":"21_CR14","unstructured":"Fisher, H.: Probabilistic learning combinations of local job-shop scheduling rules. Ind. Sched. 225\u2013251 (1963)"},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Garza-Santisteban, F., et al.: A Simulated Annealing Hyper-heuristic for job shop scheduling problems. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 57\u201364. IEEE (June 2019). \nhttps:\/\/doi.org\/10.1109\/CEC.2019.8790296\n\n, \nhttps:\/\/ieeexplore.ieee.org\/document\/8790296\/","DOI":"10.1109\/CEC.2019.8790296"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Grendreau, M., Potvin, J.: Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146 (2010)","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00207548208947745","volume":"20","author":"JH Blackstone","year":"1982","unstructured":"Blackstone, J.H., Phillips, D.T., Hogg, G.: A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int. J. Product. Res. 20, 27\u201345 (1982)","journal-title":"Int. J. Product. Res."},{"issue":"4","key":"21_CR18","doi-asserted-by":"publisher","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.: Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput. Oper. Res. 35(4), 1030\u20131046 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"21_CR19","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1016\/j.cor.2011.12.005","volume":"39","author":"RQ dao-er ji","year":"2019","unstructured":"dao-er ji, R.Q., Wang, Y.: A new hybrid genetic algorithm for job shop scheduling problem. Comput. Oper. Res. 39(10), 2291\u20132299 (2019). \nhttps:\/\/doi.org\/10.1016\/j.cor.2011.12.005","journal-title":"Comput. Oper. Res."},{"key":"21_CR20","volume-title":"Genetic Programming: on the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R., Koza, J.R.: Genetic Programming: on the Programming of Computers by Means of Natural Selection, vol. 1. MIT press, Cambridge (1992)"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-33749-0_13","volume-title":"Advances in Soft Computing","author":"E Lara-C\u00e1rdenas","year":"2019","unstructured":"Lara-C\u00e1rdenas, E., S\u00e1nchez-D\u00edaz, X., Amaya, I., Ortiz-Bayliss, J.C.: Improving hyper-heuristic performance for job shop scheduling problems using neural networks. In: Mart\u00ednez-Villase\u00f1or, L., Batyrshin, I., Mar\u00edn-Hern\u00e1ndez, A. (eds.) Advances in Soft Computing, pp. 150\u2013161. Springer International Publishing, Cham (2019)"},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Lin, J.: Backtracking search based hyper-heuristic for the flexible job-shop scheduling problem with fuzzy processing time. Eng. Appl. Artif. Intell. 77186\u2013196, (2019). \nhttps:\/\/doi.org\/10.1016\/j.engappai.2018.10.008","DOI":"10.1016\/j.engappai.2018.10.008"},{"key":"21_CR23","doi-asserted-by":"publisher","unstructured":"Masood, A., Mei, Y., Chen, G., Zhang, M.: Many-objective genetic programming for job-shop scheduling. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 209\u2013216. IEEE, Vancouver, Canada (July 2016). \nhttps:\/\/doi.org\/10.1109\/CEC.2016.7743797","DOI":"10.1109\/CEC.2016.7743797"},{"key":"21_CR24","unstructured":"Miyashita, K.: Job-shop scheduling with genetic programming. In: Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation, pp. 505\u2013512. GECCO 2000, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2000)"},{"key":"21_CR25","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-91341-4_8","volume-title":"Evolutionary and Swarm Intelligence Algorithms","author":"S Nguyen","year":"2019","unstructured":"Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Genetic programming for job shop scheduling. In: Bansal, J.C., Singh, P.K., Pal, N.R. (eds.) Evolutionary and Swarm Intelligence Algorithms. SCI, vol. 779, pp. 143\u2013167. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-319-91341-4_8"},{"issue":"6","key":"21_CR26","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manag. Sci. 42(6), 797\u2013813 (1996)","journal-title":"Manag. Sci."},{"issue":"1","key":"21_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/access.2020.3009318","volume":"8","author":"M S\u00e1nchez","year":"2020","unstructured":"S\u00e1nchez, M., Cruz-Duarte, J.M., Ortiz-Bayliss, J.C., Ceballos, H., Terashima-Mar\u00edn, H., Amaya, I.: A systematic review of hyper-heuristics on combinatorial optimization problems. IEEE Access 8(1), 1\u201328 (2020). \nhttps:\/\/doi.org\/10.1109\/access.2020.3009318","journal-title":"IEEE Access"},{"issue":"4","key":"21_CR28","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.cie.2006.09.002","volume":"51","author":"D Sha","year":"2006","unstructured":"Sha, D., Hsu, C.Y.: A hybrid particle swarm optimization for job shop scheduling problem. Comput. Ind. Eng. 51(4), 791\u2013808 (2006)","journal-title":"Comput. Ind. Eng."},{"key":"21_CR29","doi-asserted-by":"publisher","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Euro. J. Oper. Res. 64(2), 278\u2013285 (1993). \nhttps:\/\/doi.org\/10.1016\/0377-2217(93)90182-M\n\n, project Management and Scheduling","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"21_CR30","doi-asserted-by":"publisher","unstructured":"T\u00fcrky\u0131lmaz, A., \u015eenvar, \u00d6., \u00dcnal, I., Bulkan, S.: A research survey: heuristic approaches for solving multi objective flexible job shop problems. J. Intell. Manufact. February 2020. \nhttps:\/\/doi.org\/10.1007\/s10845-020-01547-4\n\n, \nhttp:\/\/link.springer.com\/10.1007\/s10845-020-01547-4","DOI":"10.1007\/s10845-020-01547-4"},{"issue":"5","key":"21_CR31","first-page":"15","volume":"8","author":"S Uckun","year":"1993","unstructured":"Uckun, S., Bagchi, S., Kawamura, K., Miyabe, Y.: Managing genetic search in job shop scheduling. IEEE Intell. Syst. 8(5), 15\u201324 (1993)","journal-title":"IEEE Intell. Syst."},{"key":"21_CR32","doi-asserted-by":"publisher","unstructured":"Wang, L., Cai, J.C, Ming, L.: An adaptive multi-population genetic algorithm for job-shop scheduling problem. Adv. Manufact. 1\u20138 (2016). \nhttps:\/\/doi.org\/10.1007\/s40436-016-0140-y","DOI":"10.1007\/s40436-016-0140-y"},{"issue":"6","key":"21_CR33","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","volume":"28","author":"L Wang","year":"2001","unstructured":"Wang, L., Zheng, D.Z.: An effective hybrid optimization strategy for job-shop scheduling problems. Comput. Oper. Res. 28(6), 585\u2013596 (2001)","journal-title":"Comput. Oper. Res."},{"key":"21_CR34","doi-asserted-by":"publisher","unstructured":"Yska, D., Mei, Y., Zhang, M.: 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 2018, pp. 149\u2013150. ACM Press, New York, USA (2018). \nhttps:\/\/doi.org\/10.1145\/3205651.3205741","DOI":"10.1145\/3205651.3205741"},{"issue":"4","key":"21_CR35","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","volume":"30","author":"J Zhang","year":"2017","unstructured":"Zhang, J., Ding, G., Zou, Y., Qin, S., Fu, J.: Review of job shop scheduling research and its new perspectives under Industry 4.0. J. Intell. Manufact. 30(4), 1809\u20131830 (2017). \nhttps:\/\/doi.org\/10.1007\/s10845-017-1350-2","journal-title":"J. Intell. Manufact."},{"key":"21_CR36","doi-asserted-by":"publisher","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.: Hyper-Heuristic Coevolution of Machine Assignment and Job Sequencing Rules for Multi-Objective Dynamic Flexible Job Shop Scheduling. IEEE Access 7, 68\u201388 (2019). \nhttps:\/\/doi.org\/10.1109\/ACCESS.2018.2883802","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Advances in Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60884-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T23:22:19Z","timestamp":1602026539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-60884-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030608835","9783030608842"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60884-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"7 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2020\/","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":"186","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":"41% - 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","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)"}}]}}