New Proposed Mobile Telecommunication Customer Call Center Roster Scheduling Under the Graph Coloring Approach

Abstract

Abstract:The call center roster scheduling is one of the significant problem in the mobile telecommunication roster management systems today; especially, creates work plan and allocates working hours for the whole day under the three shifts creates big challenge for the administrators who responsible for creating roster time tables. As a result of assigning employees into roster timetables under the manual scheduling systems create this problem more complicated. This new proposed automated roster scheduling approach developed under the two stages. As an initially, Enhanced Greedy Optimization algorithm is implemented to optimize the hotline roster and compared with other optimization algorithms (Simulated Annealing and Genetic Algorithm). In the Second stage, client server based framework introduced to access and update roster timetables for administrators as well as employees with different access levels.

Study of nurses’ roster by coloring algorithm parsus manually

“…Finally, the performance of the proposed algorithm was compared with a genetic algorithm [1]. This program was able to plan in all cases whereas the program of the genetic algorithm is taken in 92 of scheduling cases ONLY [1,2,7]. Results of SA algorithm project indicate that SA has a high performance for solving the nurses scheduling problems compared with the genetic algorithm.…”

“…Results of SA algorithm project indicate that SA has a high performance for solving the nurses scheduling problems compared with the genetic algorithm. Arumawadu, Tharanga, and Seneviratna (2016), conducted a mathematical method by using the graph coloring and C.net programming language to handle database management system [2].Some work that have been done [3] and [4] is not applicable for different reasons to present problem. In [5] their results aim to automate roster scheduling approach developed under two-stages.…”