Heuristic Algorithms for Minimizing Tardiness in Preemptive Open Shop Scheduling Problems
碩士 === 朝陽科技大學 === 工業工程與管理系碩士班 === 100 === Most scheduling problems are NP-hard combinational optimization problems. In other words, they are usually complex and difficult to solve. In this thesis, we examine the preemptive open shop scheduling problem. It is a well-known NP-hard problem. In this the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/87802522917588208399 |