{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:35:47Z","timestamp":1742934947845,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030916077"},{"type":"electronic","value":"9783030916084"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-91608-4_2","type":"book-chapter","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T20:05:55Z","timestamp":1637697955000},"page":"12-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Parallel Variable Neighborhood Search for Solving Real-World Production-Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Eneko","family":"Osaba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erlantz","family":"Loizaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xabier","family":"Goenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Sanchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,23]]},"reference":[{"issue":"5","key":"2_CR1","first-page":"296","volume":"351","author":"S Desale","year":"2015","unstructured":"Desale, S., Rasool, A., Andhale, S., Rane, P.: Heuristic and meta-heuristic algorithms and their relevance to the real world: a survey. Int. J. Comput. Eng. Res. Trends 351(5), 296\u2013304 (2015)","journal-title":"Int. J. Comput. Eng. Res. Trends"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.swevo.2019.04.008","volume":"48","author":"J Del Ser","year":"2019","unstructured":"Del Ser, J., et al.: Bio-inspired computation: where we stand and what\u2019s next. Swarm Evol. Comput. 48, 220\u2013250 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1007\/s10462-017-9605-z","volume":"52","author":"K Hussain","year":"2018","unstructured":"Hussain, K., Mohd Salleh, M.N., Cheng, S., Shi, Y.: Metaheuristic research: a comprehensive survey. Artif. Intell. Rev. 52(4), 2191\u20132233 (2018). https:\/\/doi.org\/10.1007\/s10462-017-9605-z","journal-title":"Artif. Intell. Rev."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Srinivas, M., Patnaik, L.M.: Genetic algorithms: a survey. Computer 27(6), 17\u201326 (1994)","DOI":"10.1109\/2.294849"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"4618","DOI":"10.1016\/j.eswa.2011.09.076","volume":"39","author":"BC Mohan","year":"2012","unstructured":"Mohan, B.C., Baskaran, R.: A survey: ant colony optimization based recent research and implementation on several engineering domain. Expert Syst. Appl. 39(4), 4618\u20134627 (2012)","journal-title":"Expert Syst. Appl."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.swevo.2018.04.001","volume":"44","author":"E Osaba","year":"2019","unstructured":"Osaba, E., Yang, X.-S., Fister, I., Jr., Del Ser, J., Lopez-Garcia, P., Vazquez-Pardavila, A.J.: A discrete and improved bat algorithm for solving a medical goods distribution problem with pharmacological waste collection. Swarm Evol. Comput. 44, 273\u2013286 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.asoc.2018.06.047","volume":"71","author":"E Osaba","year":"2018","unstructured":"Osaba, E., Del Ser, J., Sadollah, A., Bilbao, M.N., Camacho, D.: A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem. Appl. Soft Comput. 71, 277\u2013290 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"7","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1007\/s00521-013-1402-2","volume":"24","author":"A Ouaarab","year":"2014","unstructured":"Ouaarab, A., Ahiod, B., Yang, X.-S.: Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput. Appl. 24(7), 1659\u20131669 (2014)","journal-title":"Neural Comput. Appl."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne, A.S.: On the job-shop scheduling problem. Oper. Res. 8(2), 219\u2013223 (1960)","journal-title":"Oper. Res."},{"key":"2_CR10","unstructured":"Precup, R.-E., David, R.-C.: Nature-inspired optimization algorithms for fuzzy controlled servo systems. Butterworth-Heinemann (2019)"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1109\/TIE.2016.2607698","volume":"64","author":"R-E Precup","year":"2016","unstructured":"Precup, R.-E., David, R.-C., Petriu, E.M.: Grey wolf optimizer algorithm-based tuning of fuzzy control systems with reduced parametric sensitivity. IEEE Trans. Industr. Electron. 64(1), 527\u2013534 (2016)","journal-title":"IEEE Trans. Industr. Electron."},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2017.03.031","volume":"261","author":"Y Marinakis","year":"2017","unstructured":"Marinakis, Y., Migdalas, A., Sifaleras, A.: A hybrid particle swarm optimization-variable neighborhood search algorithm for constrained shortest path problems. Eur. J. Oper. Res. 261(3), 819\u2013834 (2017)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91608-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:44:34Z","timestamp":1710258274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91608-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030916077","9783030916084"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91608-4_2","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":"23 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDEAL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Data Engineering and Automated Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Manchester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ideal2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ideal-conf.com\/ideal2021","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":"85","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":"61","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":"72% - 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":"2.8","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.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)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","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)"}}]}}