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: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/41395217079352907293 |
| Summary: | 碩士 === 國立高雄第一科技大學 === 機械與自動化工程研究所 === 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 and compared its performance with the traditional Genetic Algorithm (GA) and Hybrid Taguchi-Genetic Algorithm (HTGA) methods. The programming software of MATLAB was employed to model the Petri nets in this study. Taguchi’s method was adopted to obtain the optimal experimental parameters. The optimal parameter settings were then programmed into the PNGA program. In conjunction with the Petri nets model, the process time was then estimated. The simulation results show that the average processing time of PNGA is about 287 (unit time). It is less than 289.55 of the GA and 288.8 of the HTGA. The standard deviation of processing time of PNGA is about 5.20. It is less than 6.0 of the GA and 5.88 of the HTGA. That is, the proposed Petri nets and genetic algorithm (PNGA) is able to provide a better job shop production scheduling optimization.
|
|---|