Genetic Optimization of Energy- and Failure-Aware Continuous Production Scheduling in Pasta Manufacturing.

Sensors (Basel)

Department of Information Technology, Ghent University/IMEC, Technologiepark 126, 9052 Ghent, Belgium.

Published: January 2019

Energy and failure are separately managed in scheduling problems despite the commonalities between these optimization problems. In this paper, an energy- and failure-aware continuous production scheduling problem (EFACPS) at the unit process level is investigated, starting from the construction of a centralized combinatorial optimization model combining energy saving and failure reduction. Traditional deterministic scheduling methods are difficult to rapidly acquire an optimal or near-optimal schedule in the face of frequent machine failures. An improved genetic algorithm (IGA) using a customized microbial genetic evolution strategy is proposed to solve the EFACPS problem. The IGA is integrated with three features: Memory search, problem-based randomization, and result evaluation. Based on real production cases from Soubry N.V., a large pasta manufacturer in Belgium, Monte Carlo simulations (MCS) are carried out to compare the performance of IGA with a conventional genetic algorithm (CGA) and a baseline random choice algorithm (RCA). Simulation results demonstrate a good performance of IGA and the feasibility to apply it to EFACPS problems. Large-scale experiments are further conducted to validate the effectiveness of IGA.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6359374PMC
http://dx.doi.org/10.3390/s19020297DOI Listing

Publication Analysis

Top Keywords

energy- failure-aware
8
failure-aware continuous
8
continuous production
8
production scheduling
8
genetic algorithm
8
performance iga
8
iga
5
genetic
4
genetic optimization
4
optimization energy-
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!