Comparative Study of Different Approaches to Solve Batch Process Scheduling and Optimisation Problems

被引:0
作者
Tan, Yaqing [1 ,2 ]
Huang, Wei [1 ]
Sun, Yanming [2 ]
Yue, Yong [1 ]
机构
[1] Univ Bedfordshire, Dept Comp Sci & Technol, Pk Sq, Luton LU1 3JU, Beds, England
[2] South China Univ Technol, Sch Business Adm, Guangzhou 510640, Guangdong, Peoples R China
来源
PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON AUTOMATION AND COMPUTING (ICAC 12) | 2012年
关键词
batch process scheduling; comparative study; Gwnetic Algorithm (GA); Constraint Programming (CP); GENETIC ALGORITHM; PLANTS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Effective approaches are important to batch process scheduling problems, especially those with complex constraints. However, most research focus on improving optimisation techniques, and those concentrate on comparing their difference are inadequate. This study develops an optimisation model of batch process scheduling problems with complex constraints and investigates the performance of different optimisation techniques, such as Genetic Algorithm (GA) and Constraint Programming (CP). It finds that CP has a better capacity to handle batch process problems with complex constraints but it costs longer time.
引用
收藏
页码:248 / 253
页数:6
相关论文
共 16 条