Scheduling Preemptive Open Shops With A Given Job Completion Sequence
碩士 === 朝陽科技大學 === 工業工程與管理系碩士班 === 98 === Most scheduling problems are NP-hard combinational optimization problems. That is, they are extremely complex and difficult to solve. In this thesis, the preemptive open shop scheduling problem with a given job completion sequence is investigated. Without los...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/09131269687179800453 |