Scheduling for M-Machine Jumping No-Wait Flowshop
碩士 === 國立交通大學 === 工業工程與管理學系 === 98 === This study investigates the scheduling of jumping no-wait flowshop(JNWF) problems. These problems have a constraint that jobs can not wait for machine during production process; the sequencing of jobs by the machine is similar, but due to the difference of jobs...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/24691995275188223976 |