Article Title

Constraint Programming Approach to Steelmaking-making Process Scheduling

Authors

Tieke Li, Management School of University of Science and Technology
Yan Li, Management School of University of Science and Technology
Qun Zhang, Management School of University of Science and Technology
Xuedong Gao, Management School of University of Science and Technology
Shufen Dai, Management School of University of Science and Technology

Abstract

This paper presents a constraint programming (CP) approach to optimal steelmaking process scheduling with constraints of processing time, limited waiting time between adjacent stages, serial batching, sequence independent setup time, release/due time, and with the objective of minimizing maximal total waiting time between adjacent charges in the same casts. The model and search strategies are proposed. Numerical experiments with the steel making process show that CP approach, under appropriate formulation and search strategies, can not only describe the problem exactly, but also can solve the problem more effectively and efficiently compared with classical exact algorithms and heuristic rules

Recommended Citation

Li, Tieke; Li, Yan; Zhang, Qun; Gao, Xuedong; and Dai, Shufen (2005) "Constraint Programming Approach to Steelmaking-making Process Scheduling," Communications of the IIMA: Vol. 5: Iss. 3, Article 2.
DOI: https://doi.org/10.58729/1941-6687.1267
Available at: https://scholarworks.lib.csusb.edu/ciima/vol5/iss3/2