Premium
Scheduling the production of rolling ingots: industrial context, model, and solution method
Author(s) -
Schwindt C.,
Trautmann N.
Publication year - 2003
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/1475-3995.00427
Subject(s) - scheduling (production processes) , mathematical optimization , computer science , job shop scheduling , resource constraints , genetic algorithm scheduling , branch and bound , heuristic , production (economics) , fair share scheduling , operations research , industrial engineering , flow shop scheduling , mathematics , distributed computing , engineering , economics , schedule , macroeconomics , operating system
Abstract We study a real‐world scheduling problem arising in the context of a rolling ingots production. First we review the production process and discuss peculiarities that have to be observed when scheduling a given set of production orders on the production facilities. We then show how to model this scheduling problem using prescribed time lags between operations, different kinds of resources, and sequence‐dependent changeovers. A branch‐and‐bound solution procedure is presented in the second part. The basic principle is to relax the resource constraints by assuming infinite resource availability. Resulting resource conflicts are then stepwise resolved by introducing precedence relationships among operations competing for the same resources. The algorithm has been implemented as a beam search heuristic enumerating alternative sets of precedence relationships.