Show simple item record

dc.contributor.authorOsaba, Eneko
dc.contributor.authorLoizaga, Erlantz
dc.contributor.authorGoenaga, Xabier
dc.contributor.authorSanchez, Valentin
dc.date.accessioned2022-03-26T13:26:39Z
dc.date.available2022-03-26T13:26:39Z
dc.date.issued2021-11-23
dc.identifier.citationOsaba, Eneko, Erlantz Loizaga, Xabier Goenaga, and Valentin Sanchez. “A Parallel Variable Neighborhood Search for Solving Real-World Production-Scheduling Problems.” Lecture Notes in Computer Science (2021): 12–20. doi:10.1007/978-3-030-91608-4_2.en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://hdl.handle.net/11556/1322
dc.description.abstractIn recent years, industry has evolved towards the efficient digitalization and optimization of products and processes. This situation is the consequence of the huge amount of information available in indus trial environments and its efficient management for reaching unprece dented productivity levels. The momentum that enjoys this application field has led to the proposal of advanced methods for the dealing of robotic processes in industrial plants, optimal packaging of goods and the efficient scheduling of production plans, among many others. This paper is focused on the last of these categories. More concretely, we present a Parallel Variable Neighborhood Search for solving an industrial problem in which a fixed amount of materials should be constructed into a limited number of production lines. The construction of these materials has sev eral particularities, such as the need of some specific tools to be correctly produced. It is also relevant to underscore that the problem solved in this research corresponds to a real-world situation, and that it is currently deployed in a production plant in the Basque Country (Spain).en
dc.description.sponsorshipWe would like to thank the Basque Government for its support through SMARTLAN project, ZL-2020/00735, and ELKARTEK program.en
dc.language.isoengen
dc.publisherSpringer Science and Business Media Deutschland GmbHen
dc.titleA Parallel Variable Neighborhood Search for Solving Real-World Production-Scheduling Problemsen
dc.typeconferenceObjecten
dc.identifier.doi10.1007/978-3-030-91608-4_2en
dc.rights.accessRightsembargoedAccessen
dc.subject.keywordsCombinatorial optimizationen
dc.subject.keywordsMetaheuristicsen
dc.subject.keywordsVariable neighborhood searchen
dc.subject.keywordsProduction-scheduling problemsen
dc.identifier.essn1611-3349en
dc.journal.titleLecture Notes in Computer Science book seriesen
dc.page.final20en
dc.page.initial12en
dc.volume.number13113en
dc.conference.titleIntelligent Data Engineering and Automated Learning – IDEAL 2021en


Files in this item

Thumbnail

    Show simple item record