PETRI NET BASED MODEL FOR JOB SHOP SCHEDULING PROBLEM IN GREEN MANUFACTURING AND ITS HYBRID METAHEURISTIC SEARCH

2006 ◽  
Vol 42 (09) ◽  
pp. 48 ◽  
Author(s):  
Quanke PAN
Keyword(s):  
Petri Net ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Green Manufacturing ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Hybrid Metaheuristic ◽  
Metaheuristic Search

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.

Memory Based Lamarckian Evolutionary Algorithm for Job Shop Scheduling Problem

2011 ◽  
Vol 21 (12) ◽  
pp. 3082-3093
Author(s):  
Zhu-Chang XIA ◽  
Fang LIU ◽  
Mao-Guo GONG ◽  
Yu-Tao QI
Keyword(s):  
Evolutionary Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document