Job-Shop Scheduling Method Based on Modified Immune Algorithm

2006 ◽  
Vol 315-316 ◽  
pp. 481-485 ◽  
Author(s):  
W.L. Wang ◽  
X.L. Xu ◽  
Yan Wei Zhao ◽  
Q. Guan
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Immune Algorithm ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Adaptive Process ◽  
Automatic Pattern Recognition ◽  
Scheduling Method ◽  
Simulation Results

The mechanism of vaccination was analyzed in the immune system and the improved immune algorithm for the job-shop scheduling problem was presented. The proposed method can reserve the advantage of vaccination and it is independent of the initial antibodies. Especially, the adaptive process of vaccination with the automatic pattern recognition can not only quicken the convergence of the algorithm but also overcome some deficiencies in distilling manually the transcendent knowledge of the problem. Simulation results show that it is an effective approach.

Petri Net and GA Based Method for JSP Optimization with Dual-Objective

2011 ◽  
Vol 121-126 ◽  
pp. 4547-4551
Author(s):  
Li Xin Qi ◽  
Ze Tao
Keyword(s):  
Petri Net ◽  
Supervisory Control ◽  
Completion Time ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Linear Constraint ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Scheduling Method

A new dual-objective scheduling method based on the controlled Petri net and GA is proposed to the job-shop scheduling problem (JSP) constrained by machines, workers. Firstly, a detailed analysis of supervisory control for Petri net with uncontrollable transitions, especially important, for OR-logics linear constraint, a new method for constructing a Petri net feedback controller based on monitor and inhibitor arcs is presented. The Petri net model is constructed based on above method in flexible JSP. Then, the genetic algorithm (GA) is applied based on the controlled Petri net model and Pareto. Function objectives of the proposed method are to minimize the completion time and the total expense of machines and workers. Finally, Scheduling example is employed to illustrate the effectiveness of the method.

Petri Net with Uncontrollable Transition and GA Based Approach for JSP

2011 ◽  
Vol 48-49 ◽  
pp. 824-829
Author(s):  
Tao Ze ◽  
Xiao Xia Liu
Keyword(s):  
Petri Net ◽  
Completion Time ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Scheduling Method

A new dual-objective scheduling method based on the controlled Petri net and GA is proposed to the job-shop scheduling problem (JSP) with urgent orders constrained by machines, workers. Firstly, a controller designed method for Petri net with uncontrollable transition is introduced, and based on the method, the Petri net model is constructed for urgent jobs in flexible job shop scheduling problem. Then, the genetic algorithm (GA) is applied based on the controlled Petri net model and Pareto. Function objectives of the proposed method are to minimize the completion time and the total expense of machines and workers. Finally, Scheduling example is employed to illustrate the effectiveness of the method.

Sign in / Sign up

Export Citation Format

Share Document