This paper addresses the multi-activity multi-day shift scheduling problem with a homogeneous workforce and a quadratic cost function for overstaffing. The objective of this problem is to assign shifts to employees and activities within these shifts, based on short time intervals, while adhering to numerous hard constraints and minimizing overstaffing. We propose a multi-neighborhood simulated annealing algorithm as a solution method, for which we introduce nine neighborhood relations. The search space and neighborhood relations are designed so that the search algorithm can be executed efficiently even on large problem instances. The method is evaluated on a benchmark dataset consisting of problem instances with varying complexity. The results demonstrate that our approach can handle even the most complex tasks and consistently produce feasible solutions for all 225 problem instances, 118 of which were previously unsolved. Furthermore, our method outperforms the solver that produced the previous best-known solutions for the dataset and achieves new best solutions for all instances. Our algorithm is capable of generating high-quality schedules within just a few seconds.
Trautsch, László Kálmán, Kovari, Bence. Multi-neighborhood simulated annealing for the multi-activity multi-day shift scheduling problem. // Journal of Scheduling. – 2026. – DOI: 10.1007/s10951-026-00886-z. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00886-z
Trautsch, László Kálmán, Kovari, & Bence (2026). Multi-neighborhood simulated annealing for the multi-activity multi-day shift scheduling problem. Journal of Scheduling. https://doi.org/10.1007/s10951-026-00886-z
Trautsch, et al. “Multi-neighborhood simulated annealing for the multi-activity multi-day shift scheduling problem.” Journal of Scheduling, 2026. doi:10.1007/s10951-026-00886-z.
@article{Trautsch2026,
title = {Multi-neighborhood simulated annealing for the multi-activity multi-day shift scheduling problem},
author = {Trautsch and Kálmán, László and Kovari and Bence},
journal = {Journal of Scheduling},
year = {2026},
doi = {10.1007/s10951-026-00886-z},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00886-z}
}
In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of...
In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation....
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...