{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:28:28Z","timestamp":1742912908075,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030728113"},{"type":"electronic","value":"9783030728120"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-72812-0_14","type":"book-chapter","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T19:02:57Z","timestamp":1616612577000},"page":"214-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evolving Allocation Rules for Beam Search Heuristics in Assembly Line Balancing"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o Pedro","family":"Gon\u00e7alves Moreira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7894-1634","authenticated-orcid":false,"given":"Marcus","family":"Ritt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,25]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.cor.2010.05.008","volume":"38","author":"C Blum","year":"2011","unstructured":"Blum, C., Miralles, C.I.: On solving the assembly line worker assignment and balancing problem via beam search. Comput. Oper. Res. 38(2), 328\u2013339 (2011)","journal-title":"Comput. Oper. Res."},{"key":"14_CR2","unstructured":"Borba, L.M., Ritt, M.: A task-oriented branch-and-bound method for the assembly line worker assignment and balancing problem. In: XLIV Simp\u00f3sio Brasileiro de Pesquisa Operacional, pp. 3192\u20133291 (2012)"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Borba, L.M., Ritt, M.: A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem. Comput. Oper. Res. 45, 87\u201396 (2014). https:\/\/doi.org\/10.1016\/j.cor.2013.12.002. Online supplement: http:\/\/www.inf.ufrgs.br\/algopt\/alwabp2","DOI":"10.1016\/j.cor.2013.12.002"},{"key":"14_CR4","unstructured":"Chaves, A.A., Lorena, L.A.N., Miralles, C.I.: Clustering search approach for the assembly line worker assignment and balancing problem. In: International Conference on Computers and Industrial Engineering, Alexandria, Egypt, pp. 1469\u20131478, October 2007"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Chaves, A.A., Lorena, L.A.N., Miralles, C.I.: Hybrid metaheuristic for the assembly line worker assignment and balancing problem. In: 6th International Workshop on Hybrid Metaheuristics, pp. 1\u201312 (2009)","DOI":"10.1007\/978-3-642-04918-7_1"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Estrada, T., Wyatt, M., Taufer, M.: A genetic programming approach to design resource allocation policies for heterogeneous workflows in the cloud. In: 21st IEEE International Conference on Parallel and Distributed Systems (ICPADS), pp. 372\u2013379 (2015). https:\/\/doi.org\/10.1109\/ICPADS.2015.54","DOI":"10.1109\/ICPADS.2015.54"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Gon\u00e7alves, J.P., Ritt, M.: Evolving task priority rules for heterogeneous assembly line balancing. In: Proceedings of IEEE Congress on Evolutionary Computation, Wellington, pp. 1423\u20131430 (2019). https:\/\/doi.org\/10.1109\/CEC.2019.8790332","DOI":"10.1109\/CEC.2019.8790332"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Langdon, W.B.: Genetic programming and evolvable machines at 20. Genet. Program. Evol. Mach. 21(1\u20132), 205\u2013217 (2020). https:\/\/doi.org\/10.1007\/s10710-019-09344-6","DOI":"10.1007\/s10710-019-09344-6"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Lowerre, B.: The Harpy speech recognition system. Ph.D. thesis, CMU (1976)","DOI":"10.1121\/1.2003013"},{"key":"14_CR10","unstructured":"Miralles, C.I., Garcia-Sabater, J.P., Andr\u00e9s, C., Cardos, M.: Advantages of assembly lines in Sheltered Work Centres for Disabled. A case study. Int. J. Prod. Res. 110(2), 187\u2013197 (2007)"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10732-012-9195-5","volume":"18","author":"MCO Moreira","year":"2012","unstructured":"Moreira, M.C.O., Ritt, M., Costa, A.M., Chaves, A.A.: Simple heuristics for the assembly line worker assignment and balancing problem. J. Heuristics 18(3), 505\u2013524 (2012). https:\/\/doi.org\/10.1007\/s10732-012-9195-5","journal-title":"J. Heuristics"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.cor.2012.07.010","volume":"40","author":"O Mutlu","year":"2013","unstructured":"Mutlu, O., Polat, O., Ayca, A.: An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II. Comput. Oper. Res. 40(1), 418\u2013426 (2013). https:\/\/doi.org\/10.1016\/j.cor.2012.07.010","journal-title":"Comput. Oper. Res."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cie.2013.12.013","volume":"69","author":"A Otto","year":"2014","unstructured":"Otto, A., Otto, C.: How to design effective priority rules: example of simple assembly line balancing. Comput. Ind. Eng. 69, 43\u201352 (2014)","journal-title":"Comput. Ind. Eng."},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Polat, O., Kalayci, C.B., \u00d6zcan Mutlu, Gupta, S.M.: A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study. Int. J. Prod. Res. 54(3), 722\u2013741 (2016). https:\/\/doi.org\/10.1080\/00207543.2015.1055344","DOI":"10.1080\/00207543.2015.1055344"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming. Lulu (2008)","DOI":"10.1145\/1274000.1274124"},{"issue":"3","key":"14_CR16","first-page":"18","volume":"6","author":"ME Salveson","year":"1955","unstructured":"Salveson, M.E.: The assembly line balancing problem. J. Ind. Eng. 6(3), 18\u201325 (1955)","journal-title":"J. Ind. Eng."},{"key":"14_CR17","unstructured":"Scholl, A.: Data of assembly line balancing problems. Technical Report 16\/1993, TH Darmstadt (1993). Schriften zur Quantitativen Betriebswirtschaftslehre"},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.ejor.2004.07.022","volume":"168","author":"A Scholl","year":"2006","unstructured":"Scholl, A., Becker, C.: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur. J. Oper. Res. 168(3), 666\u2013693 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Tan, B., Ma, H., Mei, Y.: A hybrid genetic programming hyper-heuristic approach for online two-level resource allocation in container-based clouds. In: Coello, C.A.C. (ed.) Proceedings of the IEEE Congress on Evolutionary Computation, Wellington, New Zealand, pp. 2681\u20132688 (2019). https:\/\/doi.org\/10.1109\/CEC.2019.8790220","DOI":"10.1109\/CEC.2019.8790220"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Yska, D., Mei, Y., Zhang, M.: Genetic programming hyper-heuristic with cooperative coevolution for dynamic flexible job shop scheduling. In: Castelli, M., Sekanina, L., Zhang, M., Cagnoni, S., Garc\u00eda-S\u00e1nchez, P. (eds.) Genetic Programming - 21st European Conference, Parma, Italy, pp. 306\u2013321 (2018)","DOI":"10.1007\/978-3-319-77553-1_19"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43680-3","volume-title":"Evolutionary Computation in Combinatorial Optimization","year":"2020","unstructured":"Paquete, L., Zarges, C. (eds.): EvoCOP 2020. LNCS, vol. 12102. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43680-3"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72812-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T22:26:13Z","timestamp":1698099973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72812-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030728113","9783030728120"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72812-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EuroGP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Genetic Programming (Part of EvoStar)","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":"7 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2021\/eurogp\/","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":"27","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":"11","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":"6","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":"4","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":"2","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)"}},{"value":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}