Metaheuristic algorithms solve optimisation problems by identifying the best combination
among a set of variables to enhance a function. Within metaheuristics, the main purpose of …

Abstract The Fixed Set Search (FSS) is a novel metaheuristic that adds a learning
mechanism to the Greedy Randomized Adaptive Search Procedure (GRASP). In recent …

The workforce scheduling problem in call centres is defined as assigning a number of
employees to various overlapping shifts during a specified planning horizon, considering …

Shift scheduling problem (SSP) is a complex NP-hard integer programming problem,
especially when many shifts and large number of workers of various ranks and multi-skills …

Public transport is vital for meeting people's mobility needs. Providers need to plan their
services well to offer high quality and low cost. Optimized planning can benefit providers …

Abstract The Fairness-Oriented Crew Rostering Problem (FCRP) considers the joint
optimization of attractiveness and fairness in cyclic crew rostering. Like many problems in …

Managerial and Business Economics (ME/BE) aims at using quantitative and computational
methods to make an efficient (ideally optimal) assignment of the scarce resources owned by …

Despite the impact of personnel scheduling on the sustainability of production processes, it
is a rarely studied problem in the electricity generation sector, whose main purpose is …

In this study, we try to solve a real planning problem faced in public bus transportation. It is a
multi-objective integrated crew rostering and vehicle assignment problem. We model this …

In the transportation industry, crew management is typically decomposed into two phases:
crew scheduling and crew rostering. Due to the complexity of scheduling and rostering, bus …