Rescheduling is a necessary procedure for a flexible job shop when newly arrived priority jobs must be inserted into an existing schedule. Instability measures the amount of change made to the existing schedule and is an important metrics to evaluate the quality of rescheduling solutions. This paper focuses on a flexible job-shop rescheduling problem (FJRP) for new job insertion. First, it formulates FJRP for new job insertion arising from pump remanufacturing. This paper deals with bi-objective FJRPs to minimize: 1) instability and 2) one of the following indices: a) makespan; b) total flow time; c) machine workload; and d) total machine workload. Next, it discretizes a novel and simple metaheuristic, named Jaya, resulting in DJaya and improves it to solve FJRP. Two simple heuristics are employed to initialize high-quality solutions. Finally, it proposes five objective-oriented local search operators and four ensembles of them to improve the performance of DJaya. Finally, it performs experiments on seven real-life cases with different scales from pump remanufacturing and compares DJaya with some state-of-the-art algorithms. The results show that DJaya is effective and efficient for solving the concerned FJRPs.

The rapid development of urban cities coupled with the rise in population has led to an exponentially growing number of vehicles on the roads for the latter to commute. This is adding to the already overbearing problem of traffic congestion. Short term, costly and short-sighted solutions of road infrastructure expansions are no longer suitable. One effective method of road resource allocation is focusing on the widely used traffic signal controllers’ timing schedules. Searching for a suitable or an optimal schedule for the prior via brute force to ease traffic congestion might not be the most elegant or feasible solution. Nature-inspired algorithms including evolutionary and swarm intelligence algorithms are gaining a lot of momentum. Many of these algorithms have been used in the last two decades to address different applications in the smart city era including traffic signal control (TSC). This paper conducts a comprehensive literature review on applications of evolutionary and swarm intelligence algorithms to TSC. Surveyed work is categorized based on the set of decision variables, optimization objective(s), problem modeling and solution encoding. The paper, based on gaps identified by the conducted review, identifies promising future research directions and discusses where the future research is headed.

A permutation flow-shop scheduling problem (PFSP) has been studied for a long time due to its significance in real-life applications. This work proposes an improved artificial bee colony (ABC) algorithm with $Q$ -learning, named QABC, for solving it with minimizing the maximum completion time (makespan). First, the Nawaz–Enscore–Ham (NEH) heuristic is employed to initialize the population of ABC. Second, a set of problem-specific and knowledge-based neighborhood structures are designed in the employ bee phase. $Q$ -learning is employed to favorably choose the premium neighborhood structures. Next, an all-round search strategy is proposed to further enhance the quality of individuals in the onlooker bee phase. Moreover, an insert-based method is applied to avoid local optima. Finally, QABC is used to solve 151 well-known benchmark instances. Its performance is verified by comparing it with the state-of-the-art algorithms. Experimental and statistical results demonstrate its superiority over its peers in solving the concerned problems.

In this article, an optimized tracking control scheme is studied for the quadrotor unmanned aerial vehicle (QUAV) system by combining both reinforcement learning (RL) and the backstepping technique. The RL aims to overcome the difficulty coming from solving the Hamilton–Jacobi–Bellman (HJB) equation, and it is performed via iterating both critic and actor each other, where the critic is for improving the control performance and the actor is for executing the control behavior. In mathematics, a QUAV system is composed of two connected subsystems that are, respectively, modeled by the translational and rotational dynamic equations, which are coupled via a rotation matrix; hence, the optimized tracking scheme is composed of two interconnected individual controls corresponding to the position and attitude, respectively. To achieve the two optimized position and attitude controls, the RL is constructed on the basis of the neural network (NN) approximation of the HJB equation’s solution by utilizing NN’s outstanding function approximation ability. Particularly, the position control is accomplished by introducing an intermediate control because the translational dynamic is an underactuated system. Since the proposed RL algorithm is significantly simple in comparison with the published methods, the optimized QUAV control can be easily executed in practical applications. Finally, the results are demonstrated by a Lyapunov stability analysis and a numerical simulation.

A distributed flow-shop scheduling problem with lot-streaming that considers completion time and total energy consumption is addressed. It requires to optimally assign jobs to multiple distributed factories and, at the same time, sequence them. A biobjective mathematic model is first developed to describe the considered problem. Then, an improved Jaya algorithm is proposed to solve it. The Nawaz–Enscore–Ham (NEH) initializing rule, a job-factory assignment strategy, the improved strategies for makespan and energy efficiency are designed based on the problem’s characteristic to improve the Jaya’s performance. Finally, experiments are carried out on 120 instances of 12 scales. The performance of the improved strategies is verified. Comparisons and discussions show that the Jaya algorithm improved by the designed strategies is highly competitive for solving the considered problem with makespan and total energy consumption criteria.

In the actual production, the insertion of new job and machine preventive maintenance (PM) are very common phenomena. Under these situations, a flexible job-shop rescheduling problem (FJRP) with both new job insertion and machine PM is investigated. First, an imperfect PM (IPM) model is established to determine the optimal maintenance plan for each machine, and the optimality is proven. Second, in order to jointly optimize the production scheduling and maintenance planning, a multiobjective optimization model is developed. Third, to deal with this model, an improved nondominated sorting genetic algorithm III with adaptive reference vector (NSGA-III/ARV) is proposed, in which a hybrid initialization method is designed to obtain a high-quality initial population and a critical-path-based local search (LS) mechanism is constructed to accelerate the convergence speed of the algorithm. In the numerical simulation, the effect of parameter setting on the NSGA-III/ARV is investigated by the Taguchi experimental design. After that, the superiority of the improved operators and the overall performance of the proposed algorithm are demonstrated. Next, the comparison of two IPM models is carried out, which verifies the effectiveness of the designed IPM model. Last but not least, we have analyzed the impact of different maintenance effects on both the optimal maintenance decisions and integrated maintenance-production scheduling schemes.