Makespan minimization for two parallel machines
碩士 === 國立臺灣科技大學 === 工業管理系 === 89 === In the paper, we consider a two-parallel-machine problem where one machine is not available during a time period. The unavailable time period is fixed and known in advance. A machine is not available probably because it needs preventive maintenance or periodical...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23263267640316385564 |