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

Published: 29 November 2021| Version 2 | DOI: 10.17632/v357z2ncbh.2
Contributor:

Description

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.

Files

Institutions

Universidad de Oviedo

Categories

Operations Research, Combinatorial Optimization

License