Applications of metaheuristics for solving permutation flow shop scheduling problems with unrelated parallel machines
碩士 === 中原大學 === 工業與系統工程研究所 === 102 === The permutation flowshop scheduling problem (PFSSP) with the unrelated parallel machines (UPM) has been identified as a typical NP-hard problem in the engineering area. This research develops a proposed artificial bee colony (PABC) algorithm, which has new muta...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/rbeub4 |