24 September 2018 in IEEE Transactions on Automation Science and Engineering
A semiconductor final testing scheduling problem with multiresource constraints is considered in this paper, which is proved to be NP-hard. To minimize the makespan for this scheduling problem, a cuckoo search algorithm with reinforcement learning (RL) and surrogate modeling is presented. A parameter control scheme is proposed to ensure the desired diversification and intensification of population on the basis of RL, which uses the proportion of beneficial mutation as feedback information according to Rechenberg's 1/5 criterion. To reduce computational complexity, a surrogate model is employed to evaluate the relative ranking of solutions. A heuristic approach based on the relative ranking of encoding value and a modular function is proposed to convert continuous solutions obtained from Lévy flight into discrete ones. The computational complexity and convergence analysis results are presented. The proposed algorithm is validated with benchmark and randomly generated cases. Various simulation experiments and comparison between the proposed algorithm and several popular methods are performed to validate its effectiveness.
12 November 2019 in IEEE Transactions on Automation Science and Engineering
Scheduling of complex manufacturing systems entails complicated constraints such as the mating operational one. Focusing on the real settings, this article considers an extended version of a flexible job shop problem that allows the precedence between the operations to be given by an arbitrary directed acyclic graph instead of a linear order. In order to obtain its reliable and high-performance schedule in a reasonable time, this article contributes a knowledge-based cuckoo search algorithm (KCSA) to the scheduling field. The proposed knowledge base is initially trained off-line on models before operations based on reinforcement learning and hybrid heuristics to store scheduling information and appropriate parameters. In its off-line training phase, the algorithm SARSA is used, for the first time, to build a self-adaptive parameter control scheme of the CS algorithm. In each iteration, the proposed knowledge base selects suitable parameters to ensure the desired diversification and intensification of population. It is then used to generate new solutions by probability sampling in a designed mutation phase. Moreover, it is updated via feedback information from a search process. Its influence on KCSA's performance is investigated and the time complexity of the KCSA is analyzed. The KCSA is validated with the benchmark and randomly generated cases. Various simulation experiments and comparisons between it and several popular methods are performed to validate its effectiveness.
17 January 2022 in IEEE Transactions on Automation Science and Engineering
This work considers a stochastic flexible job shop scheduling with limited extra resources and machine-dependent setup time in a semiconductor manufacturing environment, which is an NP-hard problem. In order to obtain its reliable and high-performance schedule in a reasonable time, a learning-based grey wolf optimizer is proposed. In it, an optimal computing budget allocation-based approach, which is designed for two scenarios from real manufacturing environments, is proposed to intelligently allocate computing budget and improve search efficiency. It extends the application area of optimal computing budget allocation by laying a theoretic foundation. Besides, to obtain proper control parameters iteratively, a reinforcement learning algorithm with a newly designed delay update strategy is used to build a parameter tuning scheme of a grey wolf optimizer. The scheme acts as a guide for balancing global and local search, thereby enhancing effectiveness of the proposed algorithm. The theoretic interpretation of the developed optimal computing budget allocation-based approach and the convergence analysis results of the proposed algorithm are presented. Various experiments with benchmarks and randomly generated cases are performed to compare it with several updated algorithms. The results shows its superiority over them. Note to Practitioners—Meta-heuristic are often deployed to solve semiconductor manufacturing scheduling problems. However, they face to two thorny issues when they face stochastic manufacturing environments. 1) their computational efficiency is quite low, thus requiring substantial improvement, since a stochastic optimization problem requires Monte Carlo sampling to estimate the actual objective function values in a precise manner; and 2) most of them are parameter-sensitive, and choosing their proper parameters is highly challenging in such environments. To address the first issue, we develop an optimal computing budget allocation-based method for deciding the optimal numbers of sampling times based on both prior knowledge and simulation results. To address the second one, we propose a reinforcement learning algorithm to self-adjust the parameters of our proposed method called Learning-based Grey Wolf Optimizer. In addition, we design a delay update strategy to enhance its robustness, and thus, a feasible and high-quality schedule can be founded in a short time for real-time scheduling problems. Theoretic proofs and experimental results show that the proposed method is effective and efficient. Consequently, it can be readily applicable to practical semiconductor manufacturing systems.
26 January 2021 in IEEE Transactions on Services Computing
Today's large-scale parallel workflows are often processed on heterogeneous distributed computing platforms. From an economic perspective, computing resource providers should minimize the cost while offering high service quality. It has become well-recognized that energy consumption accounts for a large part of a computing system's total cost, and timeliness and reliability are two important service indicators. This work studies the problem of scheduling a parallel workflow that minimizes the system energy consumption under the constraints of response time and reliability. We first mathematically formulate this problem as a Non-linear Mixed Integer Programming problem. Since this problem is hard to solve directly, we present some highly-efficient heuristic solutions. Specifically, we first develop an algorithm that minimizes the schedule length while meeting reliability requirement, on top of which we propose a processor-merging algorithm and a slack time reclamation algorithm using a dynamic voltage frequency scaling (DVFS) technique to reduce energy consumption. The processor-merging algorithm tries to turn off some energy-inefficient processors such that energy consumption can be minimized. The DVFS technique is applied to scale down the processor frequency at both processor and task levels to reduce energy consumption. Experimental results on two real-life workflows and extensive synthetic parallel workflows demonstrate their effectiveness.
14 May 2020 in IEEE Transactions on Intelligent Transportation Systems
Achieving the high accuracy of blind roads and crosswalks recognition is important for blind guiding equipment to help blind people sense the surrounding environment. A lightweight semantic segmentation network is proposed to quickly and accurately segment blind roads and crosswalks in a complex road environment. Specifically, a lightweight network with depthwise separable convolution as a component is used as a basic module to reduce the number of parameters of the model and increase the speed of semantic segmentation. In order to ensure the segmentation accuracy of the network, we use a densely connected atrous spatial pyramid pooling module to extract feature information of different angles and context feature modules to enhance the effectiveness of different levels of feature information fusion. To verify the effectiveness of the proposed method, we collect and produce a data set from a real environment, which contains two objects of blind roads and crosswalks¹. Experimental results demonstrate that, compared to some state-of-the-art approaches, the proposed approach greatly improves the segmentation speed, while achieving better or similar accuracy, which shows that the proposed approach provides a better basis for the application of devices for guiding the blind.
12 March 2020 in IEEE Transactions on Industrial Electronics
This paper extends a rapidly-exploring random tree (RRT) algorithm to plan the motion for a wheeled robot under kinodynamic constraints. It consists of an RRT extension algorithm that can quickly find an obstacle-free path for a robot to reach a goal, short-cutting algorithm that removes redundant waypoints from a previous obstacle-free path, and collision-based path deformation algorithm that integrates a motion-control law into a path deformation strategy. Unlike previous algorithms that apply complex steer functions during a path sampling phase, we use a straight line to connect a pair of sampled waypoints such that an obstacle-free path can be quickly found. This path is pruned by the short-cutting algorithm. With the pruned path, we propose a motion-control law that is guided by a pose-based steer function for the robot to reach its destination in a short time. A path deformation strategy is presented that shifts the waypoint away from collision point such that the trajectory can be generated without any collision. Results demonstrate that the proposed framework needs less computation time to generate a smoother trajectory with shorter length than its peers, and that simulated trajectories of our controller are close to real ones and outperforms a pose-based controller.