Solving Call Center Agent Shift Scheduling Problem by Search Algorithms
碩士 === 國立清華大學 === 工業工程與工程管理學系 === 96 === A customer call center that provides services with high level of customer satisfaction is crucial to a successful modern company. This study solves the agent shift scheduling problem for a 24-hours call center. The objective of our problem is to minimize the...
Main Authors: | Fang-Yu Chang, 張芳瑜 |
---|---|
Other Authors: | Yi-Feng Hung |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/26063330295073563035 |
Similar Items
-
Solving the Call Center Agent Shift Scheduling Problem by Constraint Programming
by: 鄭雅勻
Published: (2007) -
Solve Call Center Agent Scheduling Problems by Search Algorithms and Shadow Price to Evaluate Neighborhood Solutions
by: Huang, Tse-Feng, et al.
Published: (2009) -
Mix-integer Programming for Call Center Agent Shift Scheduling Problem
by: Ying-Shuo Lee, et al.
Published: (2007) -
To Schedule or Not To Schedule? Agentic and Cooperative Teams at Call Centers
by: Danilo eGarcia, et al.
Published: (2014-09-01) -
An indirect search algorithm for solving the spatial harvest-scheduling problem
by: Crowe, Kevin Andrew
Published: (2009)