Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.