Cargando…
Problem instances dataset of a real-world sequencing problem with transition constraints and asymmetric costs
This data article describes 30 instances of the real-world problem of sequencing steel coils in a continuous galvanizing line. Each instance is represented by a cost matrix that gives information of the cost of sequencing each pair of coils or items together (e.g. a transition). Some transitions are...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8804161/ https://www.ncbi.nlm.nih.gov/pubmed/35128004 http://dx.doi.org/10.1016/j.dib.2022.107844 |
_version_ | 1784643012626743296 |
---|---|
author | Álvarez-Gil, Nicolás García, Segundo Álvarez Rosillo, Rafael de la Fuente, David |
author_facet | Álvarez-Gil, Nicolás García, Segundo Álvarez Rosillo, Rafael de la Fuente, David |
author_sort | Álvarez-Gil, Nicolás |
collection | PubMed |
description | This data article describes 30 instances of the real-world problem of sequencing steel coils in a continuous galvanizing line. Each instance is represented by a cost matrix that gives information of the cost of sequencing each pair of coils or items together (e.g. a transition). Some transitions are forbidden due to technical limitations of the line and/or because of the properties of the coils, what makes the problem more challenging. These costs were previously obtained by a cost model that estimates the final cost of each transition for a set of coils to be sequenced in the line. Although the instances come from this real context, the problem can be theoretically seen as finding a minimum cost Hamiltonian path (e.g. a minimum cost feasible production sequence with all the coils appearing just once). It is a well-known NP-Hard combinatorial optimization problem. Since these instances represent real challenges found in the industry, they can be very useful for algorithm development and testing. Due to the cost distributions obtained for the given coils, just finding a feasible sequence can be a challenging task, especially for some types of approximate algorithms (Alvarez-Gil et al., 2022). |
format | Online Article Text |
id | pubmed-8804161 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Elsevier |
record_format | MEDLINE/PubMed |
spelling | pubmed-88041612022-02-04 Problem instances dataset of a real-world sequencing problem with transition constraints and asymmetric costs Álvarez-Gil, Nicolás García, Segundo Álvarez Rosillo, Rafael de la Fuente, David Data Brief Data Article This data article describes 30 instances of the real-world problem of sequencing steel coils in a continuous galvanizing line. Each instance is represented by a cost matrix that gives information of the cost of sequencing each pair of coils or items together (e.g. a transition). Some transitions are forbidden due to technical limitations of the line and/or because of the properties of the coils, what makes the problem more challenging. These costs were previously obtained by a cost model that estimates the final cost of each transition for a set of coils to be sequenced in the line. Although the instances come from this real context, the problem can be theoretically seen as finding a minimum cost Hamiltonian path (e.g. a minimum cost feasible production sequence with all the coils appearing just once). It is a well-known NP-Hard combinatorial optimization problem. Since these instances represent real challenges found in the industry, they can be very useful for algorithm development and testing. Due to the cost distributions obtained for the given coils, just finding a feasible sequence can be a challenging task, especially for some types of approximate algorithms (Alvarez-Gil et al., 2022). Elsevier 2022-01-19 /pmc/articles/PMC8804161/ /pubmed/35128004 http://dx.doi.org/10.1016/j.dib.2022.107844 Text en © 2022 The Authors. Published by Elsevier Inc. https://creativecommons.org/licenses/by-nc-nd/4.0/This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). |
spellingShingle | Data Article Álvarez-Gil, Nicolás García, Segundo Álvarez Rosillo, Rafael de la Fuente, David Problem instances dataset of a real-world sequencing problem with transition constraints and asymmetric costs |
title | Problem instances dataset of a real-world sequencing problem with transition constraints and asymmetric costs |
title_full | Problem instances dataset of a real-world sequencing problem with transition constraints and asymmetric costs |
title_fullStr | Problem instances dataset of a real-world sequencing problem with transition constraints and asymmetric costs |
title_full_unstemmed | Problem instances dataset of a real-world sequencing problem with transition constraints and asymmetric costs |
title_short | Problem instances dataset of a real-world sequencing problem with transition constraints and asymmetric costs |
title_sort | problem instances dataset of a real-world sequencing problem with transition constraints and asymmetric costs |
topic | Data Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8804161/ https://www.ncbi.nlm.nih.gov/pubmed/35128004 http://dx.doi.org/10.1016/j.dib.2022.107844 |
work_keys_str_mv | AT alvarezgilnicolas probleminstancesdatasetofarealworldsequencingproblemwithtransitionconstraintsandasymmetriccosts AT garciasegundoalvarez probleminstancesdatasetofarealworldsequencingproblemwithtransitionconstraintsandasymmetriccosts AT rosillorafael probleminstancesdatasetofarealworldsequencingproblemwithtransitionconstraintsandasymmetriccosts AT delafuentedavid probleminstancesdatasetofarealworldsequencingproblemwithtransitionconstraintsandasymmetriccosts |