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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.R. Baker. Introduction to sequencing and scheduling. Wiley & Sons, 1974.
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.
J. Carlier and E. Pinson. An algorithm for solving the job-shop scheduling problem. Management Science, 35(2):164–176, 1989.
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.
André Chamard, Annie Fischler, Dominique-Benoît Guinaudeau, and André Guillaud. CHIC lessons on CLP methodology. Technical Report ESPRIT EP5291 / D2.1.2.3, CHIC Project / Dassault Aviation / Bull, January 1995. (Constraint Handling in Industry and Commerce).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carlsson, M., Kreuger, P., Åtröm, E. (1998). Constraint-Based Resource Allocation and Scheduling in Steel Manufacturing. In: Gupta, G. (eds) Practical Aspects of Declarative Languages. PADL 1999. Lecture Notes in Computer Science, vol 1551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49201-1_23
Download citation
DOI: https://doi.org/10.1007/3-540-49201-1_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65527-5
Online ISBN: 978-3-540-49201-6
eBook Packages: Springer Book Archive