{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:26:13Z","timestamp":1743071173767,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"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-26504-4_41","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"513-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Multi-Population BRKGA for\u00a0Energy-Efficient Job Shop Scheduling with\u00a0Speed Adjustable Machines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6833-9316","authenticated-orcid":false,"given":"S. Mahdi","family":"Homayouni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9402-2088","authenticated-orcid":false,"given":"Dalila B. M. M.","family":"Fontes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3516-5094","authenticated-orcid":false,"given":"Fernando A. C. C.","family":"Fontes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Bansch, K., et al.: Energy-aware decision support models in production environments: a systematic literature review. Comput. Ind. Eng. 159, 107456 (2021)","key":"41_CR1","DOI":"10.1016\/j.cie.2021.107456"},{"issue":"2","key":"41_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans. Evolut. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"10","key":"41_CR3","doi-asserted-by":"publisher","first-page":"6264","DOI":"10.3390\/su14106264","volume":"14","author":"JM Fernandes","year":"2022","unstructured":"Fernandes, J.M., Homayouni, S.M., Fontes, D.B.M.M.: Energy-efficient scheduling in job shop manufacturing systems: a literature review. Sustainability 14(10), 6264 (2022)","journal-title":"Sustainability"},{"issue":"2","key":"41_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.cor.2011.03.009","volume":"39","author":"JF Gon\u00e7alves","year":"2012","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.: A parallel multi-population biased random-key genetic algorithm for a container loading problem. Comput. Oper. Res. 39(2), 179\u2013190 (2012)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"He, Y., Liu, F., Cao, H.J., Li, C.B.: A bi-objective model for job-shop scheduling problem to minimize both energy consumption and makespan. J. Cent. South Univ. Technol. 12(2), 167\u2013171 (2005)","key":"41_CR5","DOI":"10.1007\/s11771-005-0033-x"},{"doi-asserted-by":"crossref","unstructured":"Homayouni, S.M., Fontes, D.B.M.M., Gon\u00e7alves, J.F.: A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation. Int. Trans. Oper. Res. 30(2), 688\u2013716 (2023)","key":"41_CR6","DOI":"10.1111\/itor.12878"},{"doi-asserted-by":"crossref","unstructured":"Lu, C., Zhang, B., Gao, L., Yi, J., Mou, J.: A knowledge-based multiobjective memetic algorithm for green job shop scheduling with variable machining speeds. IEEE Syst. J. 16(1), 844\u2013855 (2021)","key":"41_CR7","DOI":"10.1109\/JSYST.2021.3076481"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1016\/j.jclepro.2018.11.021","volume":"210","author":"L Meng","year":"2019","unstructured":"Meng, L., Zhang, C., Shao, X., Ren, Y.: MILP models for energy-aware flexible job shop scheduling problem. J. Clean. Prod. 210, 710\u2013723 (2019)","journal-title":"J. Clean. Prod."},{"issue":"5","key":"41_CR9","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1007\/s00170-015-7987-0","volume":"85","author":"MA Salido","year":"2016","unstructured":"Salido, M.A., Escamilla, J., Giret, A., Barber, F.: A genetic algorithm for energy-efficiency in job-shop scheduling. Int. J. Adv. Manuf. Technol. 85(5), 1303\u20131314 (2016)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"5","key":"41_CR10","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.3901\/CJME.2015.0617.082","volume":"28","author":"D Tang","year":"2015","unstructured":"Tang, D., Dai, M.: Energy-efficient approach to minimizing the energy consumption in an extended job-shop scheduling problem. Chin. J. Mech. Eng. 28(5), 1048\u20131055 (2015). https:\/\/doi.org\/10.3901\/CJME.2015.0617.082","journal-title":"Chin. J. Mech. Eng."},{"issue":"4","key":"41_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1177\/1687814017695959","volume":"9","author":"L Yin","year":"2017","unstructured":"Yin, L., Li, X., Gao, L., Lu, C., Zhang, Z.: Energy-efficient job shop scheduling problem with variable spindle speed using a novel multi-objective algorithm. Adv. Mech. Eng. 9(4), 1\u201321 (2017)","journal-title":"Adv. Mech. Eng."},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"3361","DOI":"10.1016\/j.jclepro.2015.09.097","volume":"112","author":"R Zhang","year":"2016","unstructured":"Zhang, R., Chiong, R.: Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. J. Clean. Prod. 112, 3361\u20133375 (2016)","journal-title":"J. Clean. Prod."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:05:41Z","timestamp":1688198741000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","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":"72","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":"48","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":"17","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":"67% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}