Ant Colony Optimization Algorithm for Polymorphic Job Shop Scheduling Problems
碩士 === 國立臺灣大學 === 工業工程學研究所 === 101 === This research defines a scheduling problem called “Polymorphic Job Shop Scheduling Problem” (PJSP). PJSP is a new problem originated from “Job Shop Scheduling Problem” (JSP). Different from JSP, many real world scheduling conditions are considered in PJSP. Thou...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/49033478860086432729 |