Author(s):  
Liping Zhang ◽  
Xinyu Li ◽  
Long Wen ◽  
Guohui Zhang

Much of the research on flexible job shop scheduling problem has ignored dynamic events in dynamic environment where there are complex constraints and a variety of unexpected disruptions. This paper proposes an efficient memetic algorithm to solve the flexible job shop scheduling problem with random job arrivals. Firstly, a periodic policy is presented to update the problem condition and generate the rescheduling point. Secondly, the efficient memetic algorithm with a new local search procedure is proposed to optimize the problem at each rescheduling point. Five kinds of neighborhood structures are presented in the local search. Moreover, the performance measures investigated respectively are: minimization of the makespan and minimization of the mean tardiness. Finally, several experiments have been designed to test and evaluated the performance of the memetic algorithm. The experimental results show that the proposed algorithm is efficient to solve the flexible job shop scheduling problem in dynamic environment.


2012 ◽  
Vol 544 ◽  
pp. 1-5 ◽  
Author(s):  
Guo Hui Zhang

Flexible job shop scheduling problem (FJSP) is a well known NP-hard combinatorial optimization problem due to its very large search space and many constraint between jobs and machines. Evolutionary algorithms are the most widely used techniques in solving FJSP. Memetic algorithm is a hybrid evolutionary algorithm that combines the local search strategy and global search strategy. In this paper, an effective memetic algorithm is proposed to solve the FJSP. In the proposed algorithm, variable neighborhood search is adopted as local search algorithm. The neighborhood functions is generated by exchanging and inserting the key operations which belong to the critical path. The optimization objective is to minimize makespan. The experimental results obtained from proposed algorithm show that the proposed algorithm is very efficient and effective for all tested problems.


2012 ◽  
Vol 433-440 ◽  
pp. 1540-1544
Author(s):  
Mohammad Mahdi Nasiri ◽  
Farhad Kianfar

The effectiveness of the local search algorithms for shop scheduling problems is proved frequently. Local search algorithms like tabu search use neighborhood structures in order to obtain new solutions. This paper presents a new neighborhood for the job shop scheduling problem. In this neighborhood, few enhanced conditions are proposed to prevent cycle generation. These conditions allow that the neighborhood encompasses larger number of solutions without increasing the order of computational efforts.


2020 ◽  
Vol 19 (04) ◽  
pp. 837-854
Author(s):  
Huiqi Zhu ◽  
Tianhua Jiang ◽  
Yufang Wang

In the area of production scheduling, some traditional indicators are always treated as the optimization objectives such as makespan, earliness/tardiness and workload, and so on. However, with the increasing amount of energy consumption, the low-carbon scheduling problem has gained more and more attention from scholars and engineers. In this paper, a low-carbon flexible job shop scheduling problem (LFJSP) is studied to minimize the earliness/tardiness cost and the energy consumption cost. In this paper, a low-carbon flexible job shop scheduling. Due to the NP-hard nature of the problem, a swarm-based intelligence algorithm, named discrete African buffalo optimization (DABO), is developed to deal with the problem under study effectively. The original ABO was proposed for continuous problems, but the problem is a discrete scheduling problem. Therefore, some individual updating methods are proposed to ensure the algorithm works in a discrete search domain. Then, some neighborhood structures are designed in terms of the characteristics of the problem. A local search procedure is presented based on some neighborhood structures and embedded into the algorithm to enhance its searchability. In addition, an aging-based population re-initialization method is proposed to enhance the population diversity and avoid trapping into the local optima. Finally, several experimental simulations have been carried out to test the effectiveness of the DABO. The comparison results demonstrate the promising advantages of the DABO for the considered LFJSP.


2017 ◽  
Vol 2017 ◽  
pp. 1-20 ◽  
Author(s):  
Chun Wang ◽  
Zhicheng Ji ◽  
Yan Wang

A novel multiobjective memetic algorithm based on decomposition (MOMAD) is proposed to solve multiobjective flexible job shop scheduling problem (MOFJSP), which simultaneously minimizes makespan, total workload, and critical workload. Firstly, a population is initialized by employing an integration of different machine assignment and operation sequencing strategies. Secondly, multiobjective memetic algorithm based on decomposition is presented by introducing a local search to MOEA/D. The Tchebycheff approach of MOEA/D converts the three-objective optimization problem to several single-objective optimization subproblems, and the weight vectors are grouped by K-means clustering. Some good individuals corresponding to different weight vectors are selected by the tournament mechanism of a local search. In the experiments, the influence of three different aggregation functions is first studied. Moreover, the effect of the proposed local search is investigated. Finally, MOMAD is compared with eight state-of-the-art algorithms on a series of well-known benchmark instances and the experimental results show that the proposed algorithm outperforms or at least has comparative performance to the other algorithms.


Sign in / Sign up

Export Citation Format

Share Document