Robust Single Machine Scheduling to Minimize Number of Tardy Jobs
碩士 === 國立臺北科技大學 === 工業工程與管理研究所 === 98 === The general scheduling problem that assume that all task parameters can be specified precisely in advance of scheduling, allowing the outcome of any scheduling decision to be determined exactly, but many parameters cannot be executed exactly. Therefore, the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/u2ax3z |