Using Multiple Trajectory Search Algorithm to Solve the Open Shop Scheduling Problem
碩士 === 國立中興大學 === 資訊網路多媒體研究所 === 98 === The open shop scheduling problem is an NP-hard combinatorial optimization problem and has long attracted much attention. In this thesis, we propose a new metaheuristic called the multiple trajectory search to solve the open shop scheduling problem. Observing t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/17179126365769955728 |