Order Scheduling with Total Order Completion Time on Non-Identical Parallel Machines
碩士 === 國立交通大學 === 工業工程與管理系所 === 102 === We study the order scheduling problem under the non-identical parallel machines environment in the fully flexible case. Our goal is to minimize total order completion time and the decision is to assign all jobs to all machines. We first show two lemmas for o...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/27639066444614093523 |