Constraint-Based Resource Allocation and Scheduling in Steel Manufacturing
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.
- K.R. Baker. Introduction to sequencing and scheduling. Wiley & Sons, 1974.
- Bruckner, P., Thiele, O. (1996) A branch & bound method for the general-shop problem with sequencing dependent setup-times. OR Spectrum 18: pp. 145-161
- Carlier, J., Pinson, E. (1989) An algorithm for solving the job-shop scheduling problem. Management Science 35: pp. 164-176 CrossRef
- Carlsson, M., Ottosson, G., Carlson, B. An open-ended finite domain constraint solver. In: Glaser, H., Hartel, P., Kucken, H. eds. (1997) PLILP’97, International Symposium on Programming Languages: Implementations, Logics, and Programming. Springer, Berlin Heidelberg CrossRef
- André Chamard, Annie Fischler, Dominique-Benoît Guinaudeau, and André Guillaud. CHIC lessons on CLP methodology. Technical Report ESPRIT EP5291 / D18.104.22.168, CHIC Project / Dassault Aviation / Bull, January 1995. (Constraint Handling in Industry and Commerce).
- Constraint-Based Resource Allocation and Scheduling in Steel Manufacturing
- Book Title
- Practical Aspects of Declarative Languages
- Book Subtitle
- First International Workshop, PADL’99 San Antonio, Texas, USA, January 18–19, 1999 Proceedings
- pp 335-349
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- flow maximization
- finite domain constraints
- steel manufacturing
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.