By Topic

Model and Solution for Steelmaking-Continuous Casting 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

2 Author(s)
Zhang Xujun ; Nat. Eng. Res. Center for Adv. Rolling, Univ. of Sci. & Tech., Beijing, China ; Lv Zhimin

In this paper we present a constraint satisfaction model for the steelmaking-continuous casting scheduling problem solved by constraint programming methods. The problem is described with parallel machines in each processing stage, and the capacity of each machine is limited, and then there are different constraints in the problem, such as process routing constraint, temporal constraint and so on. The model of the problem is demonstrated with real data from practical production data. Based on the constraint programming toolkits, the model is easily established and solved quickly. Use heuristic algorithm to get the optimization solution after finding a feasible solution. The computational results of the problem displayed with a timetable for planned charges in the end of the paper show that the method for this model is feasible.

Published in:

Information Technology and Computer Science, 2009. ITCS 2009. International Conference on  (Volume:1 )

Date of Conference:

25-26 July 2009