Constraint-based resource allocation and scheduling in steel manufacturing

Abstract

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. © Springer-Verlag Berlin Heidelberg 1998.