A Hybrid Algorithm to Minimize Regular Criteria in the Job-shop Scheduling Problem with Maintenance Activities, Sequence Dependent and Set-up Times

Author(s):  
Andrés A. García-León ◽  
William F. Torres Tapia
2021 ◽  
Vol 10 (02) ◽  
pp. 017-020
Author(s):  
Sumaia E. Eshim ◽  
Mohammed M. Hamed

In this paper, a hybrid genetic algorithm (HGA) to solve the job shop scheduling problem (JSSP) to minimize the makespan is presented. In the HGA, heuristic rules are integrated with genetic algorithm (GA) to improve the solution quality. The purpose of this research is to investigate from the convergence of a hybrid algorithm in achieving a good solution for new benchmark problems with different sizes. The results are compared with other approaches. Computational results show that a hybrid algorithm is capable to achieve good solution for different size problems.


2012 ◽  
Vol 630 ◽  
pp. 502-507
Author(s):  
Hai Yan Wang

This paper presents a hybrid algorithm to address the flexible job-shop scheduling problem (FJSP). Based on Differential Evolution (DE), a global search method is introduced in the hybrid algorithm, where variations are made to the mutation and crossover operators in DE, according to the quantum rotation gate. And an Interchange-based local search method is further adopted in the proposed algorithm to gain a better performance. Experiments are performed to show the efficiency of the proposed algorithm.


Sign in / Sign up

Export Citation Format

Share Document