A Genetic Approach to Green Flexible Job Shop Problem Under Uncertainty
摘要
Flexible job shop scheduling problem with energy and makespan minimization objectives, and uncertain processing times that are modeled with intervals is addressed in this work. The problem is solved by a genetic algorithm using a lexicographic goal programming approach and the results evaluated with respect to the lower and upper bounds that come from various sources and methods.