Flexible job-shop green scheduling considering transportation time and machine preventive maintenance
For the flexible job shop scheduling problem,considering the transportation time,machine preventive ma-intenance and energy consumption constraints simultaneously,a mixed-integer programming model that minimized makespan and total energy consumption was established,and a multi-objective discrete Jaya algorithm was proposed to solve this problem.According to the problem's characteristics,a two-layer encoding method based on operation and machine was designed,and the population initialization method that balanced the processing time and energy consumption was adopted to generate a high-quality initial population.To transform the solution into a feasible and effective scheduling scheme,a greedy insertion decoding method with the preventive maintenance dynamic adjust-ment strategy and transportation time was designed.According to the different situations of the solution,the indi-vidual was updated by different ways.The effectiveness of the proposed algorithm was verified by comparing with the commonly used multi-objective optimization algorithms through 18 datasets with different scales.Experimental results showed that the proposed algorithm could effectively solve the flexible job-shop green scheduling considering transportation time and machine preventive maintenance.