Because of COVID-19, factories are facing many difficulties, such as shortage of workers and social alienation. How to improve production performance under limited labor resources is an urgent problem for global manufacturing factories. This work studies an energy-efficient job-shop scheduling problem with limited workers. Those workers can have multiskills. A many-objective model with five objectives, that is: 1) makespan; 2) total tardiness; 3) total idle time; 4) total worker cost; and 5) total energy, is built. To solve this many-objective optimization problem (MaOP), a novel fitness evaluation mechanism (FEM) based on fuzzy correlation entropy (FCE) is adopted. Two construction methods for reference points are proposed to build the bridge between MaOP and a fuzzy set. Based on FCE and cluster methods, an environmental selection mechanism (ESM) is proposed to achieve a balance between solution convergence and diversity. With the proposed FEM and ESM, two many-objective evolutionary algorithms are proposed to solve MaOP. The effect of FCE-based FEM and ESM on the performance of algorithms is verified via experiments. The proposed algorithms are compared with four well-known peers to test their performance. The extensive experimental results show that they are very competitive for the considered many-objective scheduling problem.

Energy-efficient production scheduling research has received much attention because of the massive energy consumption of the manufacturing process. In this article, we study an energy-efficient job-shop scheduling problem with sequence-dependent setup time, aiming to minimize the makespan, total tardiness and total energy consumption simultaneously. To effectively evaluate and select solutions for a multiobjective optimization problem of this nature, a novel fitness evaluation mechanism (FEM) based on fuzzy relative entropy (FRE) is developed. FRE coefficients are calculated and used to evaluate the solutions. A multiobjective optimization framework is proposed based on the FEM and an adaptive local search strategy. A hybrid multiobjective genetic algorithm is then incorporated into the proposed framework to solve the problem at hand. Extensive experiments carried out confirm that our algorithm outperforms five other well-known multiobjective algorithms in solving the problem.

This paper deals with a reentrant hybrid flow shop problem with sequence-dependent setup time and limited buffers where there are multiple unrelated parallel machines at each stage. A mathematical model with the minimization of total weighted completion time is constructed for this problem. Considering the complexity of the problem at hand, an effective cooperative adaptive genetic algorithm (CAGA) is proposed. In the algorithm, a dual chain coding scheme and a staged-hierarchical decoding approach are, respectively, designed to encode and decode each solution. Six dispatch heuristics and a dynamic adjustment method are introduced to define initial population. To balance the exploration and exploitation abilities, three effective operations are implemented: (1) two new crossover and mutation operators with collaborative mechanism are imposed on genetic algorithm; (2) an adaptive adjustment strategy is introduced to re-optimize better solutions after mutation operations, where ant colony search algorithm and modified greedy heuristic are intelligently switched; (3) a reset strategy with dynamic variable step strategy is embedded to re-generate some non-improved solutions. A Taguchi method of design of experiment is adopted to calibrate the parameter values in the presented algorithm. Comparison experiments are executed on test instances with different scale problems. Computational results show that the proposed CAGA is more effective and efficient than several well-known algorithms in solving the studied problem.