Flexible Security Guard Scheduling to Satisfy Defensive Power by Tabu-Search Algorithm

Abstract

Many security guards are needed to guarantee defensive power in top grade communities, in banks or in the other security places. Security guards pay attention to workload, specially, night work and overwork. But security guard companies are facing many challenges such as how to raise defend capability and how to reduce human cost. These challenges are interrelated with security guards scheduling problems. So security guards scheduling problem become a very important problem. In this paper, how to solve the actual security guards scheduling problem for security guard companies is key point. In this paper, a novel scheduling model for twenty four hours (three shifts) is proposed to guarantee defensive power and to balance workload. A new Tabu-Search approach is proposed in this paper to solve security guards scheduling problem. This paper shows that it is very flexible and accurate to find near-optimal solutions in very short time. The computational results demonstrate the robustness of Tabu-Search approach. A detail discussion of the results indicates that management objectives are satisfied, defensive power as strong guarantee on service.