Personnel Scheduling With Heuristic Search Approach

Personnel Scheduling or rostering problem is an assignment of shifts to employees. An efficient way of crew scheduling can save the scheduling cost for an organizations by means of using minimum manpower. And mostly cost incurred is due to employees assigned for performing a given task so this cost can be saved by optimizing the process of personnel scheduling. This paper describes a tabu search based heuristic algorithm which is applied on bus driver scheduling problem. Solution to this problem is an assignment of duties such that each employee should know when to work and also which task to perform while working. Finding the solution of this problem is minimization of the overall employees needed to cover all the shifts in the schedule and total service time and total scheduling cost while satisfying all the constraints.