By Topic

Model and Solution for Hot Strip Rolling Scheduling Problem Based on Constraint Programming Method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xujun Zhang ; Nat. Eng. Res. Center for Adv. Rolling, USTB, Beijing, China ; Zhimin Lv ; Xiaoqing Song

This paper presents a mathematical model and a solution approach to solve the hot rolling scheduling problem. The problem is formulated as a constraint satisfaction problem with various process constraints, and the mathematical model is established by constraint programming conveniently. The purpose of this research is to find a slab sequence in any given slab set. In order to reduce the complexity of solving the problem and improve the solution efficiency, the original problem is divided into two sub-problems: slab-choose problem and slab-sequence problem. The slab-sequence stage is to sort the slabs from the result of the slab-choose stage. The model of the problem is tested with practical production data. Based on the constraint programming, the model is solved quickly. The computational results of the problem show that the method for this model is feasible, and the results meet the requirements of practical applications.

Published in:

Computer and Information Technology (CIT), 2012 IEEE 12th International Conference on

Date of Conference:

27-29 Oct. 2012