Minimizing shifts for personnel task scheduling problems: A three-phase algorithm
We propose a state-of-the-art algorithm for the personnel scheduling problem. Sorting tasks in the ascending order of their start times yields good initial solutions. The Boltzmann function enables solutions to overcome their local minima. The advantage of the algorithm is significant, especially for large-scale problems.
personnel task scheduling problem scheduling shift minimization