Entropy-Enhanced Genetic Algorithm with Tabu Search for Job Shop Scheduling Problems

2012 ◽  
Vol 590 ◽  
pp. 557-562 ◽  
Author(s):  
Ying Jie Huang ◽  
Xi Fan Yao ◽  
Dong Yuan Ge ◽  
Yong Xiang Li
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Hybrid Genetic Algorithm ◽  
Traditional Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Benchmark Instances

By combining Genetic algorithm with Tabu search algorithm and adjusting crossover rate and mutation rate based on information entropy, a hybrid genetic algorithm was proposed for larger-scale job shop scheduling problems, and the benchmark instances were used to verify the algorithm with simulation. Simulation results show that the proposed algorithm can solve larger-scale job shop scheduling problems, and it has obvious advantages over traditional scheduling algorithms.

scholarly journals A Tabu-Genetic Hybrid Search Algorithm for Job-shop Scheduling Problem

2019 ◽  
Vol 95 ◽  
pp. 04007
Author(s):  
Yan Ge ◽  
Aimin Wang ◽  
Zijin Zhao ◽  
Jieran Ye
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Search Performance ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Hybrid Search ◽  
Shop Scheduling

To deal with the job-shop scheduling problem (JSP), a tabu-genetic hybrid search algorithm is proposed. The algorithm generates several initial solutions distributed in the whole solution space for tabu search by genetic algorithm, which avoids the over-dependence on the initial solution of tabu search algorithm. With the mechanism mentioned above, the algorithm proposed has both global search performance of genetic algorithm and local search performance of labu search algorithm. Finally, a program was developed with the achral data of FT (10x 10). to verify the feasibility and effectiveness of the algorithm. The result shows that the algorithm achieves satisfactory results in all indexes mentioned above.

scholarly journals A Hybrid Genetic Algorithm with a Knowledge-Based Operator for Solving the Job Shop Scheduling Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Hamed Piroozfard ◽  
Kuan Yew Wong ◽  
Adnan Hassan
Keyword(s):  
Genetic Algorithm ◽  
Production Management ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Hybrid Genetic Algorithm ◽  
Neighborhood Search ◽  
Function Evaluation ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Knowledge Based

Scheduling is considered as an important topic in production management and combinatorial optimization in which it ubiquitously exists in most of the real-world applications. The attempts of finding optimal or near optimal solutions for the job shop scheduling problems are deemed important, because they are characterized as highly complex andNP-hard problems. This paper describes the development of a hybrid genetic algorithm for solving the nonpreemptive job shop scheduling problems with the objective of minimizing makespan. In order to solve the presented problem more effectively, an operation-based representation was used to enable the construction of feasible schedules. In addition, a new knowledge-based operator was designed based on the problem’s characteristics in order to use machines’ idle times to improve the solution quality, and it was developed in the context of function evaluation. A machine based precedence preserving order-based crossover was proposed to generate the offspring. Furthermore, a simulated annealing based neighborhood search technique was used to improve the local exploitation ability of the algorithm and to increase its population diversity. In order to prove the efficiency and effectiveness of the proposed algorithm, numerous benchmarked instances were collected from the Operations Research Library. Computational results of the proposed hybrid genetic algorithm demonstrate its effectiveness.

A Hybrid Genetic Algorithm for Solving Job Shop Scheduling Problems

2013 ◽  
Vol 845 ◽  
pp. 559-563
Author(s):  
Hamed Piroozfard ◽  
Adnan Hassan ◽  
Ali Mokhtari Moghadam ◽  
Ali Derakhshan Asl
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Hybrid Genetic Algorithm ◽  
Computational Time ◽  
Insertion Mutation ◽  
Scheduling Problems ◽  
Exact Methods ◽  
Shop Scheduling ◽  
Mutation Operators

Job shop scheduling problems are immensely complicated problems in machine scheduling area, and they are classified as NP-hard problems. Finding optimal solutions for job shop scheduling problems with exact methods incur high cost, therefore, looking for approximate solutions with meta-heuristics are favored instead. In this paper, a hybrid framework which is based on a combination of genetic algorithm and simulated annealing is proposed in order to minimize maximum completion time i.e. makespan. In the proposed algorithm, precedence preserving order-based crossover is applied which is able to generate feasible offspring. Two types of mutation operators namely swapping and insertion mutation are used in order to maintain diversity of population and to perform intensive search. Furthermore, a new approach is applied for arranging operations on machines, which improved solution quality and decreased computational time. The proposed hybrid genetic algorithm is tested with a set of benchmarking problems, and simulation results revealed efficiency of the proposed hybrid genetic algorithm compared to conventional genetic based algorithm.

Sign in / Sign up

Export Citation Format

Share Document