The Optimum Job Shop Production Scheduling by Using Petri Nets and Genetic Algorithm
碩士 === 國立高雄第一科技大學 === 機械與自動化工程研究所 === 100 === This study aims at exploring the job shop production scheduling optimization. A Petri nets and genetic algorithm (PNGA) is present. Using the job shop production of a mold factory as a case study, we examined the capability of the proposed PNGA method a...
Main Authors: | Yi-ming Pan, 潘一銘 |
---|---|
Other Authors: | Wen-Long Yao |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/41395217079352907293 |
Similar Items
-
Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net
by: Behnam Barzegar, et al.
Published: (2012-01-01) -
An Eugenic Genetic Algorithm for the Job-shop scheduling problem
by: Fu-yi Huang, et al.
Published: (2006) -
A Hybrid Estimation-of-Distribution Algorithm for Scheduling Flexible Job Shop With Limited Buffers Based on Petri Nets
by: Zhenxin Gao, et al.
Published: (2020-01-01) -
A Timed Petri Net Approach for Job Shop Scheduling with Setup Time and Routing Flexibility
by: Bo-Wei Huang, et al.
Published: (2013) -
Planning and Optimization of AGV Jobs by Petri Net and Genetic Algorithm
by: Anita Gudelj, et al.
Published: (2012-12-01)