An Improved Genetic Algorithm for Dual-Resource Constrained Flexible Job Shop Scheduling

Author(s):  
Cao Xianzhou ◽  
Yang Zhenhe
2021 ◽  
Vol 243 ◽  
pp. 02010
Author(s):  
Muhammad Kamal Amjad ◽  
Shahid Ikramullah Butt ◽  
Naveed Anjum

This paper presents optimization of makespan for Flexible Job Shop Scheduling Problems (FJSSP) using an Improved Genetic Algorithm integrated with Rules (IGAR). Machine assignment is done by Genetic Algorithm (GA) and operation selection is done using priority rules. Improvements in GA include a new technique of adaptive probabilities and a new forced mutation technique that positively ensures the generation of new chromosome. The scheduling part also proposed an improved scheduling rule in addition to four standard rules. The algorithm is tested against two well-known benchmark data set and results are compared with various algorithms. Comparison shows that IGAR finds known global optima in most of the cases and produces improved results as compared to other algorithms.


Algorithms ◽  
2019 ◽  
Vol 12 (11) ◽  
pp. 243
Author(s):  
Xiaolin Gu ◽  
Ming Huang ◽  
Xu Liang

For solving the complex flexible job-shop scheduling problem, an improved genetic algorithm with adaptive variable neighborhood search (IGA-AVNS) is proposed. The improved genetic algorithm first uses a hybrid method combining operation sequence (OS) random selection with machine assignment (MA) hybrid method selection to generate the initial population, and it then groups the population. Each group uses an improved genetic operation for global search, then the better solutions from each group are stored in the elite library, and finally, the adaptive local neighborhood search is used in the elite library for detailed local searches. The simulation experiments are carried out by three sets of international standard examples. The experimental results show that the IGA-AVNS algorithm is an effective algorithm for solving flexible job-shop scheduling problems.


Machines ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 108
Author(s):  
Shoujing Zhang ◽  
Haotian Du ◽  
Sebastian Borucki ◽  
Shoufeng Jin ◽  
Tiantian Hou ◽  
...  

Aiming at solving the problem of dual resource constrained flexible job shop scheduling problem (DRCFJSP) with differences in operating time between operators, an artificial intelligence (AI)-based DRCFJSP optimization model is developed in this paper. This model introduces the differences between the loading and unloading operation time of workers before and after the process. Subsequently, the quantum genetic algorithm (QGA) is used as the carrier; the process is coded through quantum coding; and the niche technology is used to initialize the population, adaptive rotation angle, and quantum mutation strategy to improve the efficiency of the QGA and avoid premature convergence. Lastly, through the Kacem standard calculation example and the reliability analysis of the factory workshop processing process example, performance evaluation is conducted to show that the improved QGA has good convergence and does not fall into premature ability, the improved QGA can solve the problem of reasonable deployment of machines and personnel in the workshop, and the proposed method is more effective for the DRCFJSP than some existing methods. The findings can provide a good theoretical basis for actual production and application.


Sign in / Sign up

Export Citation Format

Share Document