An efficient optimal solution to the coil sequencing problem in electro-galvanizing line

DOI10.1016/j.cor.2010.01.009zbMath1188.90162OpenAlexW2081845611MaRDI QIDQ976044

Yang Yang, Lixin Tang, Jiyin Liu

Publication date: 11 June 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.01.009

zbMATH Keywords

modellingdynamic programmingsequencingsteel productionelectro-galvanizing line

Mathematics Subject Classification ID

Production models (90B30) Case-oriented studies in operations research (90B90) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
• Scheduling in a continuous galvanizing line
• Scheduling linear deteriorating jobs with rejection on a single machine
• Single machine scheduling and due date assignment with positionally dependent processing times
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
• The hot strip mill production scheduling problem: A tabu search approach
• Integer Programming Formulation of Traveling Salesman Problems
• State-space relaxation procedures for the computation of bounds to routing problems
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem
• A review of planning and scheduling systems and methods for integrated steel production

This page was built for publication: An efficient optimal solution to the coil sequencing problem in electro-galvanizing line