Using Simulation-based Algorithm to Solve a Call Center Staffing Problem: Experimental Comparison and Analysis
碩士 === 國立成功大學 === 工業與資訊管理學系 === 103 === We propose and improve three Simulation-based algorithms, the Cutting Plane Algorithm, Lagrangian Algorithm, and Iterative Algorithm, to solve the agent staffing problem in a single-skill call center. This problem aims to minimize the total costs of agents s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/dg524m |