Scheduling and optimisation of batch plants: model development and comparison of approaches
| dc.contributor.author | Tan, Yaqing | en |
| dc.contributor.author | Huang, Wei | en |
| dc.contributor.author | Sun, Yanming | en |
| dc.contributor.author | Yue, Yong | en |
| dc.date.accessioned | 2014-10-30T10:47:43Z | |
| dc.date.available | 2014-10-30T10:47:43Z | |
| dc.date.issued | 2014-06 | |
| dc.identifier.citation | Tan Y., Huang W., Sun Y., Yue Y. (2014) 'Scheduling and optimisation of batch plants: model development and comparison of approaches' International Journal of Computer Applications in Technology 49 (3/4):227 | en |
| dc.identifier.issn | 0952-8091 | |
| dc.identifier.issn | 1741-5047 | |
| dc.identifier.doi | 10.1504/IJCAT.2014.062359 | |
| dc.identifier.uri | http://hdl.handle.net/10547/333414 | |
| dc.description.abstract | The application of parallel machines and storage facilities provides flexibility but raises challenges for batch plants. This research proposes a scheduling model in batch plants, considering complex real-world constraints that were seldom addressed together. Two optimisation approaches, genetic algorithm (GA) and constraint programming (CP), are applied to solve the complex batch plant scheduling problem. A case study and scalability tests are conducted to investigate different performance of GA and CP in the problem to prepare for further research application. It is found that the CP approach has a better performance in solving batch plant scheduling problems with complex constraints although it needs longer time. The ‘restart’ search strategy is better than two other search strategies for the CP approach. | |
| dc.language.iso | en | en |
| dc.publisher | Inderscience Publishers | en |
| dc.relation.url | http://www.inderscience.com/link.php?id=62359 | en |
| dc.rights | Archived with thanks to International Journal of Computer Applications in Technology | en |
| dc.subject | parallel machines | en |
| dc.subject | batch plants | en |
| dc.subject | genetic algorithm | en |
| dc.subject | constraint programming | en |
| dc.subject | batch plant scheduling | en |
| dc.title | Scheduling and optimisation of batch plants: model development and comparison of approaches | en |
| dc.type | Article | en |
| dc.contributor.department | University of Bedfordshire | en |
| dc.identifier.journal | International Journal of Computer Applications in Technology | en |
| html.description.abstract | The application of parallel machines and storage facilities provides flexibility but raises challenges for batch plants. This research proposes a scheduling model in batch plants, considering complex real-world constraints that were seldom addressed together. Two optimisation approaches, genetic algorithm (GA) and constraint programming (CP), are applied to solve the complex batch plant scheduling problem. A case study and scalability tests are conducted to investigate different performance of GA and CP in the problem to prepare for further research application. It is found that the CP approach has a better performance in solving batch plant scheduling problems with complex constraints although it needs longer time. The ‘restart’ search strategy is better than two other search strategies for the CP approach. |