A New Interior Search Algorithm for Energy-Saving Flexible Job Shop Scheduling with Overlapping Operations and Transportation Times

Abstract

Energy-saving scheduling has been pointed out as an interesting research issue in the manufacturing field, by which energy consumption can be effectively reduced through production scheduling from the operational management perspective. In recent years, energy-saving scheduling problems in flexible job shops (ESFJSPs) have attracted considerable attention from scholars. However, the majority of existing work on ESFJSPs assumed that the processing of any two consecutive operations in a job cannot be overlapped. In order to be close to real production, the processing overlapping of consecutive operations is allowed in this paper, while the job transportation tasks are also involved between different machines. To formulate the problem, a mathematical model is set up to minimize total energy consumption. Due to the NP-hard nature, a new interior search algorithm (NISA) is elaborately proposed following the feature of the problem. A number of experiments are conducted to verify the effectiveness of the NISA algorithm. The experimental results demonstrate that the NISA provides promising results for the considered problem. In addition, the computational results indicate that the increasing transportation time and sub-lot number will increase the transportation energy consumption, which is largely responsible for the increase in total energy consumption.

Keywords

• flexible job shop
• overlapping operation
• job transportation
• total energy consumption
• interior search algorithm