The Improved Mutation-based Particle Swarm Optimization for Call Center Staff Rostering
碩士 === 元智大學 === 資訊管理學系 === 95 === Most of problems that happen in the real world, appear in a discrete way mostly, such as timetable scheduling, vehicle routing problem or flow shop scheduling etc. This research improves discrete particle swarm optimization and applies it to staff scheduling and ros...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/70010455154662965442 |
| id |
ndltd-TW-095YZU05396019 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-095YZU053960192016-05-23T04:17:52Z http://ndltd.ncl.edu.tw/handle/70010455154662965442 The Improved Mutation-based Particle Swarm Optimization for Call Center Staff Rostering 改良式突變型態之粒子群演算法於客服人員排班的應用 Chang-Ming Lee 黎長明 碩士 元智大學 資訊管理學系 95 Most of problems that happen in the real world, appear in a discrete way mostly, such as timetable scheduling, vehicle routing problem or flow shop scheduling etc. This research improves discrete particle swarm optimization and applies it to staff scheduling and rostering problem. We firstly, set up staff scheduling and rostering problem with constraint satisfied problem, and then establish whole constraint condition that have to consider in rostering process according to problem mode, finally get one successful optimization form. 邱昭彰 2007 學位論文 ; thesis 42 zh-TW |
| collection |
NDLTD |
| language |
zh-TW |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 元智大學 === 資訊管理學系 === 95 === Most of problems that happen in the real world, appear in a discrete way mostly, such as timetable scheduling, vehicle routing problem or flow shop scheduling etc. This research improves discrete particle swarm optimization and applies it to staff scheduling and rostering problem. We firstly, set up staff scheduling and rostering problem with constraint satisfied problem, and then establish whole constraint condition that have to consider in rostering process according to problem mode, finally get one successful optimization form.
|
| author2 |
邱昭彰 |
| author_facet |
邱昭彰 Chang-Ming Lee 黎長明 |
| author |
Chang-Ming Lee 黎長明 |
| spellingShingle |
Chang-Ming Lee 黎長明 The Improved Mutation-based Particle Swarm Optimization for Call Center Staff Rostering |
| author_sort |
Chang-Ming Lee |
| title |
The Improved Mutation-based Particle Swarm Optimization for Call Center Staff Rostering |
| title_short |
The Improved Mutation-based Particle Swarm Optimization for Call Center Staff Rostering |
| title_full |
The Improved Mutation-based Particle Swarm Optimization for Call Center Staff Rostering |
| title_fullStr |
The Improved Mutation-based Particle Swarm Optimization for Call Center Staff Rostering |
| title_full_unstemmed |
The Improved Mutation-based Particle Swarm Optimization for Call Center Staff Rostering |
| title_sort |
improved mutation-based particle swarm optimization for call center staff rostering |
| publishDate |
2007 |
| url |
http://ndltd.ncl.edu.tw/handle/70010455154662965442 |
| work_keys_str_mv |
AT changminglee theimprovedmutationbasedparticleswarmoptimizationforcallcenterstaffrostering AT lízhǎngmíng theimprovedmutationbasedparticleswarmoptimizationforcallcenterstaffrostering AT changminglee gǎiliángshìtūbiànxíngtàizhīlìziqúnyǎnsuànfǎyúkèfúrényuánpáibāndeyīngyòng AT lízhǎngmíng gǎiliángshìtūbiànxíngtàizhīlìziqúnyǎnsuànfǎyúkèfúrényuánpáibāndeyīngyòng AT changminglee improvedmutationbasedparticleswarmoptimizationforcallcenterstaffrostering AT lízhǎngmíng improvedmutationbasedparticleswarmoptimizationforcallcenterstaffrostering |
| _version_ |
1718278362217054208 |