Please use this identifier to cite or link to this item:

Genetic algorithm for large-size multi-stage batch plant scheduling

Authors He, Yaohua HKUST affiliated (currently or previously)
Hui, Chi-Wai View this author's profile
Issue Date 2007
Source Chemical engineering science , v. 62, (5), 2007, MAR, p. 1504-1523
Summary This paper presents a heuristic approach based on genetic algorithm (GA) for solving large-size multi-stage multi-product scheduling problem (MMSP) in batch plant. The proposed approach is suitable for different scheduling objectives, such as total process time, total flow time, etc. In the algorithm, solutions to the problem are represented by chromosomes that will be evolved by GA. A chromosome consists of order sequences corresponding to the processing stages. These order sequences are then assigned to processing units according to assignment strategies such as forward or backward assignment, active scheduling technique or similar technique, and some heuristic rules. All these measures greatly reduce unnecessary search space and increase the search speed. In addition, a penalty method for handling the constraints in the problem, e.g., the forbidden changeovers, is adopted, which avoids the infeasibility during the GA search and further greatly increases the search speed. (c) 2006 Elsevier Ltd. All rights reserved.
ISSN 0009-2509
Rights Chemical engineering science © 2007 Elsevier. The Journal's web site is located at
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
OriginalGeneticAlgorithmforLargesizeMultiStageBatchPlantScheduling.pdf 819545 B Adobe PDF