A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry

DOI10.1016/j.cor.2005.11.010zbMath1185.90220OpenAlexW2011947022MaRDI QIDQ878576

Gongshu Wang, Jiyin Liu, Lixin Tang

Publication date: 26 April 2007

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

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

zbMATH Keywords

integer programmingdynamic programmingcolumn generationbranch-and-pricemolten iron allocationstate-space relaxation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (4)

A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem ⋮ A metaheuristic algorithm for a locomotive routing problem arising in the steel industry ⋮ A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production ⋮ An efficient optimal solution to the coil sequencing problem in electro-galvanizing line

Cites Work

• Unnamed Item
• A dynamic programming algorithm for single machine scheduling with ready times
• Optimal solutions for the cutting stock problem
• A mathematical programming model for scheduling steelmaking-continuous casting production
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Solving Parallel Machine Scheduling Problems by Column Generation
• Steel-making process scheduling using Lagrangian relaxation
• Exact algorithms for scheduling multiple families of jobs on parallel machines
• Scheduling independent tasks to reduce mean finishing time
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A review of planning and scheduling systems and methods for integrated steel production

This page was built for publication: A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry