A Search Economics Based Algorithm for Job Shop Scheduling Problem
碩士 === 國立中山大學 === 資訊工程學系研究所 === 107 === The job-shop scheduling problem (JSSP) is certainly one of the most important scheduling problems because many famous scheduling problems are either a derived case or a special case of the JSSP. Since JSSP is NP-hard, many metaheuristic algorithms, such as gen...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/y75m4r |