DocumentCode :
1645049
Title :
Constraint-based Algorithm for Slab Sequencing Problem
Author :
Dongfen, Guo ; Hongying, Ye
Author_Institution :
Shijiazhuang Post & Telecommun. Tech. Coll., Shijiazhuang
fYear :
2007
Firstpage :
338
Lastpage :
342
Abstract :
Slab sequencing problem is an NP-hard problem with complex side constraints. In this paper, slab sequencing problem is modeled as a constraint satisfaction problem. A constraint-based algorithm is proposed to solving this problem. During the solving procedure, domains of the variables are firstly preprocessed by using consistency technology to prune the search space; the solution is secondly constructed by the dynamic variable selection and value selection algorithm, when a variable is instantiated, the constraint propagation is triggered, domains of the unscheduled variables are filtered and the subtours are dynamically forbidden. Slab sequence is further adjusted by a modified 2-opt exchange to improve the solution quality. The validity of the proposed algorithm is demonstrated by the simulation experiment.
Keywords :
computational complexity; constraint theory; operations research; search problems; slabs; NP-hard problem; complex side constraints; constraint propagation; constraint satisfaction problem; constraint-based algorithm; dynamic variable selection; search space; slab sequencing problem; value selection algorithm; Continuous production; Data preprocessing; Educational institutions; Furnaces; Input variables; Job shop scheduling; NP-hard problem; Slabs; Space technology; Telecommunication control; Constraint propagation; Constraint satisfaction problem; Slab sequencing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control Conference, 2007. CCC 2007. Chinese
Conference_Location :
Hunan
Print_ISBN :
978-7-81124-055-9
Electronic_ISBN :
978-7-900719-22-5
Type :
conf
DOI :
10.1109/CHICC.2006.4347080
Filename :
4347080
Link To Document :
بازگشت