TY - GEN
T1 - A Parallel Variable Neighborhood Search for Solving Real-World Production-Scheduling Problems
AU - Osaba, Eneko
AU - Loizaga, Erlantz
AU - Goenaga, Xabier
AU - Sanchez, Valentin
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021/11/23
Y1 - 2021/11/23
N2 - In 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).
AB - In 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).
KW - Combinatorial optimization
KW - Metaheuristics
KW - Variable neighborhood search
KW - Production-scheduling problems
KW - Combinatorial optimization
KW - Metaheuristics
KW - Variable neighborhood search
KW - Production-scheduling problems
UR - http://www.scopus.com/inward/record.url?scp=85126446111&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-91608-4_2
DO - 10.1007/978-3-030-91608-4_2
M3 - Conference contribution
SN - 9783030916077
VL - 13113
T3 - 0302-9743
SP - 12
EP - 20
BT - unknown
A2 - Camacho, David
A2 - Tino, Peter
A2 - Allmendinger, Richard
A2 - Yin, Hujun
A2 - Tallón-Ballesteros, Antonio J.
A2 - Tang, Ke
A2 - Cho, Sung-Bae
A2 - Novais, Paulo
A2 - Nascimento, Susana
PB - Springer Science and Business Media Deutschland GmbH
T2 - 22nd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2021
Y2 - 25 November 2021 through 27 November 2021
ER -