Solution of security personnel scheduling problem in a student dormitory with analytic hierarchy process and conic scalarization method

The shift planning problem is a common optimization problem in an uninterrupted production and service system. There are two situations that complicate the shift scheduling problem. The first of these is to pay attention to many factors while making shifts. The second is to consider the wishes of the personnel who will enter the shift. In this study, the problem of assigning security personnel to shifts in one of the dormitories of the General Directorate of Credit and Dormitories operating in the service sector is discussed. In the analyzed problem, the shift and vacation day preferences of the security personnel were evaluated with the Analytical Hierarchy Process (AHP) method. A dual-objective 0-1 integer linear decision model is proposed for the shift assignment of Security Personnel using the preferences obtained from the AHP. The first objective of the model is to minimize the total number of security personnel assigned, while the second objective is to minimize the sum of the non-preferred day and shift priorities of the security personnel obtained from the AHP.The proposed dual-purpose 0-1 integer linear decision model was solved using the Conical Scalarization Method using the Lingo 11.0 optimization package program. As a result of the model and method applied, the optimum solution required for shift planning was provided. The shift schedule was created by minimizing the number of personnel. Key Words: Shift Planning, Personal Scheduling, Analytical Hierarchy Process, Multi- Objective Programming, Conik Scalarization Method