A Hybrid Algorithm for Minimizing Makespan for Sequence-Dependent Family Setup time Scheduling Problem on Unrelated Parallel Machines
碩士 === 逢甲大學 === 工業工程與系統管理學系 === 104 === Minimizing makespan for sequence-dependent family setup time scheduling problem on unrelated parallel machines is an NP-hard problem. In this search, based on genetic algorithm we developed a hybrid heuristics algorithm to solve this problem. First, we used di...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/t5e9p8 |