A stochastic bi-objective cybersecurity analyst scheduling problem with preferential days off and upskilling decisions

Shukla, Mayank ; Sarmah, S.P. ; Tiwari, Manoj Kumar (2023) A stochastic bi-objective cybersecurity analyst scheduling problem with preferential days off and upskilling decisions Computers & Industrial Engineering, 183 . p. 109551. ISSN 0360-8352

Full text not available from this repository.

Official URL: https://doi.org/10.1016/j.cie.2023.109551

Related URL: http://dx.doi.org/10.1016/j.cie.2023.109551

Abstract

With higher shifting rates towards digitalization, companies are more prone to the rising number of cyberattacks. Despite the insufficient supply of experts needed to safeguard the Information and Communications (ICT) system, their retention, training, and skill enhancement have become an additional challenge. The scheduling of experts is one among many areas in cybersecurity defense strategies which has attracted some recent concern. This work features a solution to a more generalized bi-objective scheduling problem using epsilon constraint and NSGA-II using a mixed integer linear program (MILP). Here, the model characterizes the enhancement of the employees’ analyzing ability while simultaneously focusing on overtime preferences. Although, a single objective approach is seen in a few articles yet bi-objective formulation in expert scheduling is never attempted. Results witness the optimal schedule in a tabulated structure with four overlapping shifts and eight-time windows implicitly representing rows and columns.

Item Type:Article
Source:Copyright of this article belongs to 2016 Elsevier Ltd.
ID Code:139955
Deposited On:11 Sep 2025 12:56
Last Modified:11 Sep 2025 12:56

Repository Staff Only: item control page