TY - DATA
T1 - Data accompanying the research on CGL Scheduling Problem
PY - 2020/02/11
AU - Nicolas Alvarez Gil
UR - https://data.4tu.nl/articles/dataset/Data_accompanying_the_research_on_CGL_Scheduling_Problem/12707663/1
DO - 10.4121/uuid:91a72f0a-d94b-416e-a22b-485b9b1b4277
KW - Combinatorial optimization
KW - Continuous Galvanizing Line (CGL)
KW - Scheduling
KW - Steel industry
N2 - These instances are the real cost matrices of a continuous galvanizing line of a Spanish steel company. The element (i,j) of the matrix represent the cost of producing coil i right before coil j. If a value (i,j) is equal to -1, it means that the transition from coil i to coil j is forbidden. The problem consists in finding the minimun cost hamiltonian path (i.e. a minimun cost feasible sequence)
ER -