Green Flexible Job Shop Scheduling Using Genetic Algorithms with Adaptive Neighborhood Search
TL;DR
A Adaptive Genetic Algorithm (AGA) is designed to solve the Multi-Objective Flexible Job Shop Green Scheduling Problem (MO-FJGSP), which aims to minimize the makespan, total energy consumption, and total carbon emissions.
Abstract
With the rise of the concept of green manufacturing, incorporating energy consumption-related objectives into scheduling problems has become an important research field. Combined with actual production scenarios, this study constructs a mathematical model for the Multi-Objective Flexible Job Shop Green Scheduling Problem (MO-FJGSP), which aims to minimize the makespan, total energy consumption, and total carbon emissions. To address the limitation of the traditional Genetic Algorithm (GA) in terms of insufficient local search capability, an Adaptive Genetic Algorithm (AGA) is designed to solve the model. A population initialization method that integrates global and local load minimization is proposed to accelerate the elimination of inferior individuals; the elite retention and roulette wheel selection strategies are combined to prevent the algorithm from falling into local optima. Simulation tests based on standard benchmark instances show that the improved GA can effectively solve the MO-FJGSP, significantly improving both the solution speed and quality. This study provides a novel methodological approach to optimizing production scheduling in green manufacturing environments.