A Heuristic method for the Unrealated Parallel Machines Scheduling problem
碩士 === 朝陽大學 === 工業工程與管理研究所 === 86 === In this research , we examine the total weighted earliness and tardiness unrelated parallel machine scheduling problem. The problem is known to be NP-hard. A tow-stage heuristic method is presented . In the first stage, the la...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/72285006873605606124 |