Two-Machine No-wait Openshop Scheduling Problem
碩士 === 朝陽科技大學 === 工業工程與管理系碩士班 === 91 === The openshop scheduling problem can be stated as follows. There are n independent jobs and m different machines. There is no restriction on the order in which the operations of a job are to be performed. Each machine can process at most one job at a time and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/58804559741516615119 |