A GRASP heuristic for slab scheduling at continuous casters

DOI10.1007/s00291-013-0330-yzbMath1305.90422OpenAlexW1976483424MaRDI QIDQ480761

Matthias Gerhard Wichmann, Thomas Volling, Thomas Stefan Spengler

Publication date: 11 December 2014

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-013-0330-y

zbMATH Keywords

schedulingGRASPcontinuous castingflexible orders

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• GRASP

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex
• A probabilistic heuristic for a computationally difficult set covering problem
• A mixed integer programming model for scheduling orders in a steel mill
• Enhancing stochastic search performance by value-biased randomization of heuristics
• An annotated bibliography of GRASP – Part I: Algorithms
• A branch and bound algorithm for the generalized assignment problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• A review of planning and scheduling systems and methods for integrated steel production

This page was built for publication: A GRASP heuristic for slab scheduling at continuous casters