Assembly shop scheduling and energy-efficient scheduling have attracted much attention in the past decades; however, energy consumption is often ignored in assembly hybrid flow shop scheduling. Neglecting energy consumption will greatly diminish the progress of sustainable manufacturing. In this study, an assembly hybrid flow shop scheduling problem considering energy consumption (EAHFSP) is investigated, and a population diversity-based artificial bee colony algorithm (DABC) is proposed to minimize the makespan and total energy consumption (TEC) simultaneously. Diversified search strategies based on rank value are introduced to the employed bee phase; a novel probability selection method in the onlooker bee phase is designed to control the selection pressure; moreover, a diversity control strategy is applied to improve the diversity of food sources and avoid falling into stagnation. A number of experiments based on 44 extended benchmark instances from the literature and a real case are conducted to test the performance of the DABC algorithm. The statistical results show that the DABC algorithm is superior to the other four state-of-the-art algorithms on over 70% of the instances corresponding to metrics $IGD$ and $c$, which means that the DABC algorithm is effective and competitive in solving the considered EAHFSP.

With the development of IoT and 5G technologies, edge computing has become a key driver for providing compute, network and storage services. The dramatic increase in data size and the complexity of AI computation models have put higher demands on the performance of edge computing. Rational and optimal scheduling of AI data-intensive computation tasks can greatly improve the overall performance of edge computing. To this end, a particle swarm algorithm based on objective ranking is proposed to optimize task execution time and scheduling cost by designing a task scheduling model to achieve task scheduling in an edge computing environment. It is necessary to fully understand the concept of symmetry of resource utilization and task execution cost indicators. The method utilizes nonlinear inertia weights and shrinkage factor update mechanisms to improve the optimization-seeking ability and convergence speed of the particle-to-task scheduling solution space. The task execution time and scheduling cost are greatly reduced. Simulation experiments are conducted using the Cloudsim toolkit to experimentally compare the proposed algorithm TS-MOPSO with three other particle swarm improvement algorithms, and the experimental results show that the task execution time, maximum completion time and total task scheduling cost are reduced by 31.6%, 23.1% and 16.6%, respectively. The method is suitable for handling large and complex AI data-intensive task scheduling optimization efforts.

Due to conflicts among objectives of multi-objective optimization (MO) problems, it remains challenging to gain high-quality Pareto fronts for different MO issues. Attempt to handle this challenge and obtain high-performance Pareto fronts, this paper proposes a novel MO optimizer via leveraging particle swarm optimization (PSO) with evolutionary game theory (EGT). Firstly, a modified self-adaptive PSO (MSAPSO) adopting a novel self-adaptive parameter adaption rule determined by evolutionary strategy of EGT to tune the three key parameters of each particle is proposed in order to well balance the exploration and exploitation abilities of MSAPSO. Then, a parameter selection principle is provided to sufficiently guarantee convergence of MSAPSO followed after the analytical convergence investigation of this optimizer so as to assure convergence of the searched Pareto front toward the true Pareto front as far as possible. Subsequently, a MSAPSO-based MO optimizer is developed, in which an external archive is applied to preserve the searched non-dominated solutions and a circular sorting method is amalgamated with the elitist-saving method to update the external archive. Lastly, the performance of the proposed method is examined by 16 benchmark test functions against 4 well-known MOO methods. The simulation results reveal that the proposed method dominates its peers regarding to the quality of the Pareto fronts for most of the studied benchmarks. Furthermore, the results of the non-parametric analysis confirm that the proposed method significantly outperforms its contenders at the confidential level of 95% over the 16 benchmarks.