Problem instances of the sequencing problem of a steel continuous galvanizing line

These 30 instances are 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 item i right before item j. If an element [i, j] of the matrix is equal to -1, it means that the transition from item i to item j is forbidden. The problem consists in finding the minimum-cost Hamiltonian path (i.e. a minimum-cost feasible sequence). See README.txt for further details.本数据集包含30组真实成本矩阵，均取自某西班牙钢铁企业的连续镀锌生产线。矩阵的[i,j]元素表示紧邻工件j之前生产工件i所需的切换成本。若矩阵中某元素[i,j]的值为-1，则代表禁止从工件i切换至工件j。本问题的求解目标为寻找最小成本哈密顿路径（Hamiltonian path），即满足约束条件的最小成本可行生产序列。详细信息请参阅README.txt文件。