An Improved Quantum Rotation Gate in Genetic Algorithm for Job Shop Scheduling Problem

2018 ◽  
Author(s):  
Ling Li ◽  
Guangzhen Cui ◽  
Xuliang Lv ◽  
Xiaodong Sun ◽  
Huaixiao Wang
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Quantum Rotation Gate

Association Rule Mining for Job Shop Scheduling Problem Based on Genetic Algorithm

2012 ◽  
Vol 629 ◽  
pp. 730-734 ◽  
Author(s):  
Cun Liang Yan ◽  
Wei Feng Shi
Keyword(s):  
Genetic Algorithm ◽  
Association Rule ◽  
Association Rule Mining ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Rule Mining ◽  
Concept Hierarchy ◽  
Shop Scheduling

Job shop scheduling problem (JSP) is the most typical scheduling problem, In the process of JSP based on genetic algorithm (GA), large amounts of data will be produced. Mining them to find the useful information is necessary. In this paper dividing, hashing and array (DHA) association rule mining algorithm is used to find the frequent itemsets which contained in the process, and extract the corresponding association rules. Concept hierarchy is used to interpret the rules, and lots of useful rules appeared. It provides a new way for JSP study.

The Study of Job Shop Scheduling Based on Genetic Algorithm

2011 ◽  
Vol 201-203 ◽  
pp. 795-798
Author(s):  
Jun Xing Xiong ◽  
Jin Ping Zhao ◽  
Hai Ning Tu
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

Aiming at Job Shop Scheduling Problem with Minimal Makespan, This paper is designed to use genetic algorithm to solve the problem of job shop scheduling, and also achieves the algorithm by using the C#. Application shows that the genetic algorithm to solve job shop scheduling problem is efficient and has good application value.

Sign in / Sign up

Export Citation Format

Share Document