Comparative study of different approaches to solve batch process scheduling and optimisation problems
AffiliationUniversity of Bedfordshire
MetadataShow full item record
AbstractEffective 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.
CitationTan, Y., Huang, W., Sun, Y. & Yue, Y. (2012) 'Comparative study of different approaches to solve batch process scheduling and optimisation problems', Automation and Computing (ICAC), 2012 18th International Conference on, Automation and Computing (ICAC), 2012 18th International Conference on,p1-6.
TypeConference papers, meetings and proceedings
The following license files are associated with this item: