Scheduling Open Shops to Minimize Total Weighted Tardiness
碩士 === 朝陽大學 === 工業工程與管理系碩士班 === 88 === The open shop scheduling problem can be stated as follows. There are n independent jobs and m different machines. Each job consists of m operations, each of which must be processed on one of these machines. There is no restriction on the order in which the oper...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/14844442733778160515 |