“…It has been proved that manufacturing scheduling problems, essentially belonging to Job shop scheduling problems (JSP), are a class of NP-hard problems [ 59 ]. Many models and algorithms have been proposed to obtain a suboptimal solution, such as PICRO (preference-inspired chemical reaction optimization algorithm) [ 60 ], HPGA (hybrid PSO-GA algorithm) [ 61 ], PRGA-Sched (priority rule-based genetic algorithm scheduling) [ 62 ], LCAFS (league championship algorithm with free search) [ 63 ], MOGA-TIG (multi-objective genetic algorithm with tabu-enhanced iterated greedy local search strategy) [ 64 ], and so on. Though an approximate optimal production plan can be effectively solved by these methods, the availability and reliability of sensor nodes is seldom followed closely.…”