An efficient optimal solution to the coil sequencing problem in electro-galvanizing line
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
- A review of planning and scheduling systems and methods for integrated steel production
- An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem
- Integer Programming Formulation of Traveling Salesman Problems
- Scheduling in a continuous galvanizing line
- Scheduling linear deteriorating jobs with rejection on a single machine
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Single machine scheduling and due date assignment with positionally dependent processing times
- Solution of a Large-Scale Traveling-Salesman Problem
- State-space relaxation procedures for the computation of bounds to routing problems
- The hot strip mill production scheduling problem: A tabu search approach
Cited in
(4)- Scheduling of parallel continuous annealing lines with alternative processing modes to optimize efficiency under tardiness constraints
- Integrated sequencing and scheduling in coil coating
- Penalty-based sequencing strategy implemented within a knowledge-based system
- Scheduling in a continuous galvanizing line
This page was built for publication: An efficient optimal solution to the coil sequencing problem in electro-galvanizing line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976044)