Robust Scheduling for a Multi-process Routing Flexible Job Shop Considering Preventive Maintenance
Fluctuations in processing and maintenance durations lead to significant deviations between actual production and planned schedules,rendering reserved maintenance opportunities impractical.To address this,two uncertain parameters are introduced to describe the variability of processing and maintenance durations and the degree to which constraints can be violated.The scheduling problem for a multi-route flexible job shop considering preventive maintenance is transformed into a robust equivalent problem under deterministic conditions.A simulated annealing algorithm is designed based on encoding and neighborhood search techniques to solve the problem.The robust scheduling soluton is compared with the actual production schedule,and experimental results demonstrate the effectiveness of the robust optimization approach.
multi-routeflexible job shoprandom processing timerandom maintenance time
NETL
NSTL
万方数据
维普
