{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:58:56Z","timestamp":1743011936026,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031341465"},{"type":"electronic","value":"9783031341472"}],"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-34147-2_1","type":"book-chapter","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T19:02:26Z","timestamp":1685127746000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["VNS Variant Approach Metaheuristics for\u00a0Parallel Machines Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2908-6300","authenticated-orcid":false,"given":"Claudia R.","family":"Gatica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-1746-4946","authenticated-orcid":false,"given":"Silvia M.","family":"Molina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3784-1754","authenticated-orcid":false,"given":"Guillermo","family":"Leguizam\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/3-540-45706-2_132","volume-title":"Euro-Par 2002 Parallel Processing","author":"Alba","year":"2002","unstructured":"Alba, et al.: MALLBA: a library of skeletons for combinatorial optimisation. In: Monien, B., Feldmann, R. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 927\u2013932. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45706-2_132"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-022-19215-3","volume":"12","author":"J Cai","year":"2022","unstructured":"Cai, J., Lu, S., Cheng, J., Wang, L., Gao, Y., Tan, T.: Collaborative variable neighborhood search for multi-objective distributed scheduling in two-stage hybrid flow shop with sequence-dependent setup times. Sci. Rep. 12(1), 1\u201319 (2022)","journal-title":"Sci. Rep."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, W., Guo, P., Zhang, Z., Zeng, M., Liang, J.: Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs. Math. Prob. Eng. 2012, 928312 (2012)","DOI":"10.1155\/2012\/928312"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Erden, C., Demir, H.I., K\u00f6k\u00e7am, A.H.: Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms. Math. Prob. Eng. 2019, 1572614 (2019)","DOI":"10.1155\/2019\/1572614"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman, M.: A comparison of alternative test of significance for the problem of the m rankings. Ann. Math. Stat. 11, 86\u201392 (1940)","journal-title":"Ann. Math. Stat."},{"key":"1_CR6","first-page":"674","volume":"3","author":"M Friedman","year":"1937","unstructured":"Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J. Am. Stat. Assoc. 3, 674\u2013701 (1937)","journal-title":"J. Am. Stat. Assoc."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Guar\u00edn, P.J., Cantor, J., Cort\u00e9s-Guerrero, C., Guzm\u00e1n Pardo, M.A., Rivera Rasc\u00f3n, S.A.: Implementaci\u00f3n del algoritmo vns-deepso para el despacho de energ\u00eda en redes distribuidas inteligentes. Inge Cuc (2019)","DOI":"10.17981\/ingecuc.15.1.2019.13"},{"key":"1_CR8","volume-title":"Evaluation of variants of the VNS metaheuristics for the parallel machines scheduling problem","author":"C Gatica","year":"2022","unstructured":"Gatica, C., Molina, S., Leguizam\u00f3n, G.: Evaluation of variants of the VNS metaheuristics for the parallel machines scheduling problem. XXVIII Congreso Argentino de Ciencias de la Computaci\u00f3n, La Rioja Argentina (2022)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","DOI":"10.1016\/S0377-2217(00)00100-4"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optimiz. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optimiz."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"J. Derrac, S. Garc\u00eda, D.M., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut. Comput. 1, 3\u201318 (2011)","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Lei, Deming y He, S.: An adaptive artificial bee colony for unrelated parallel machine scheduling with additional resource and maintenance. Exp. Syst. Appl. 205, 117577 (2022)","DOI":"10.1016\/j.eswa.2022.117577"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Lu, S., Ma, C., Kong, M., Zhou, Z., Liu, X.: Solving a stochastic hierarchical scheduling problem by VNS-based metaheuristic with locally assisted algorithms. Appl. Soft Comput. 130, 109719 (2022)","DOI":"10.1016\/j.asoc.2022.109719"},{"key":"1_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105999","volume":"149","author":"S Maecker","year":"2023","unstructured":"Maecker, S., Shen, L., M\u00f6nch, L.: Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness. Comput. Oper. Res. 149, 105999 (2023)","journal-title":"Comput. Oper. Res."},{"key":"1_CR15","volume-title":"Heuristic scheduling systems","author":"TE Morton","year":"1993","unstructured":"Morton, T.E., Pentico, D.W.: Heuristic scheduling systems. John Wiley and Sons, Inc, With Applications to Production Systems and Project Management (1993)"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10479-017-2481-8","volume":"272","author":"J Pei","year":"2019","unstructured":"Pei, J., Cheng, B., Liu, X., Pardalos, P.M., Kong, M.: Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Ann. Oper. Res. 272(1), 217\u2013241 (2019)","journal-title":"Ann. Oper. Res."},{"key":"1_CR17","unstructured":"Pinedo, M.: Scheduling Theory, Algorithms, and Systems. PRENTICE HALL (1995)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Rudek, R.: A fast neighborhood search scheme for identical parallel machine scheduling problems under general learning curves. Inform\u00e1tica blanda aplicada, 113, 108023 (2021)","DOI":"10.1016\/j.asoc.2021.108023"},{"key":"1_CR19","unstructured":"Senne, E.L.F., Chaves, A.A.: A VNS heuristic for an industrial parallel machine scheduling problem. ICIEOM CIO Valladolid (Spain, 2013)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Talbi, E.G.: Metaheuristics from design to implementation. John Wiley & Sons (Canada, 2009)","DOI":"10.1002\/9780470496916"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"de Vargas Fortes, E., Macedo, L.H., de Araujo, P.B., Romero, R.: A VNS algorithm for the design of supplementary damping controllers for small-signal stability analysis. Int. J. Electr. Power Energy Syst. 94, 41\u201356 (2018)","DOI":"10.1016\/j.ijepes.2017.06.017"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, Xiangyi y Chen, L.: A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance. Inform\u00e1tica & Investigaci\u00f3n de operaciones 143, 105738 (2022)","DOI":"10.1016\/j.cor.2022.105738"}],"container-title":["Communications in Computer and Information Science","Computer Science \u2013 CACIC 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34147-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T19:03:01Z","timestamp":1685127781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34147-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031341465","9783031341472"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34147-2_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CACIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentine Congress of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"La Rioja","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","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":"3 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cacic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cacic2022.unlar.edu.ar\/","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":"RedUNCI","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"184","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":"20","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":"11% - 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.2","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":"1.6","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)"}}]}}