Two-machine No-wait Total Completion Time Flowshop Scheduling Problem
碩士 === 朝陽科技大學 === 工業工程與管理系碩士班 === 94 === The flowshop scheduling problem can be stated as follows. There are n independent jobs and m different machines. There is 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 eac...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/jj2x9a |