Constraint-Based Resource Allocation and Scheduling in Steel Manufacturing
- First Online:
This paper describes a flow maximization problem in steel manufacturing, decomposes it into three sub-problems, and models them in terms of finite domain constraints. Greedy algorithms are used for solving the sub-problems. The constraints are used for maintaining consistency rules, not for optimization. A tool implementing these algorithms and equipped with a GUI has been implemented.
Keywordsflow maximization scheduling finite domain constraints steel manufacturing
Unable to display preview. Download preview PDF.
- K.R. Baker. Introduction to sequencing and scheduling. Wiley & Sons, 1974.Google Scholar
- P. Bruckner and O. Thiele. A branch & bound method for the general-shop problem with sequencing dependent setup-times. OR Spectrum, 18:145–161, 1996.Google Scholar
- Mats Carlsson, Greger Ottosson, and Björn Carlson. An open-ended finite domain constraint solver. In H. Glaser, P. Hartel, and H. Kucken, editors, PLILP’97, International Symposium on Programming Languages: Implementations, Logics, and Programming, number 1292 in Lecture Notes in Computer Science, Southampton, September 1997. Springer-Verlag.CrossRefGoogle Scholar
- André Chamard, Annie Fischler, Dominique-Benoît Guinaudeau, and André Guillaud. CHIC lessons on CLP methodology. Technical Report ESPRIT EP5291 / D126.96.36.199, CHIC Project / Dassault Aviation / Bull, January 1995. (Constraint Handling in Industry and Commerce).Google Scholar