An Adaptive Variable Neighborhood Search Algorithm to Solve Green Flexible Job Shop Problem

Green manufacturing imposes higher expectations on manufacturing engineering, not only with respect to classic competitive factors such as cost, time and quality, but also with sustainable factors such as resources and energy. In this paper, we investigate green flexible job shop scheduling problem (GFJSP) with variable processing speeds. To solve the GFJSP problem, we propose an adaptive Variable Neighborhood Search to minimize the makespan and the total energy consumption. A number of experiments have been conducted to evaluate the performance of our proposed adaptive VNS algorithm. A comparative study was presented and have verified the out performance of the proposed algorithm against other VNS variants.