Non-Preemptive Completion Time Open Shop Scheduling Problem
碩士 === 朝陽科技大學 === 工業工程與管理系碩士班 === 90 === The open shop scheduling problem is a hard combinational optimization problem. Most variations of open shop scheduling problems are known to be NP-hard. Polynomial time algorithms only exist for a few special cases. In this research we study the non-preemp...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/34721353676303874298 |