| Summary: | 碩士 === 國立成功大學 === 工業與資訊管理學系 === 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 subject to service-level requirements that are estimated by simulation. The first algorithm combines the Cutting plane method and integer programming, then we improve it by using the Multiple Feasibility Check Procedure (MFCP). The second algorithm combines the Lagrange method and local search, then we improve it by updating lagrange multipliers. The third algorithm combines the queueing method for staffing, then we improve it by adjusting transform method of service-level. In our numerical experiments, all three algorithm perform better with new setting, though each of them has some strengths and weaknesses, the Cutting Plane Algorithm and the Iterative Algorithm perform better under most scenarios.
|
|---|
