A successful three-phase metaheuristic for the shift minimization personal task scheduling problem

DOI10.1155/2021/8876990zbMath1479.90104OpenAlexW3128254134MaRDI QIDQ2064748

Nico Kyngäs, Kimmo Nurmi

Publication date: 6 January 2022

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/8876990

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• AtMostNValue

Cites Work

• Unnamed Item
• Algorithms for large scale shift minimisation personnel task scheduling problems
• A graph colouring model for assigning a heterogeneous workforce to a given schedule
• Staff rostering at a large international airport
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Local search for shift design.
• A greedy heuristic for shift minimization personnel task scheduling problem
• Personnel scheduling: a literature review
• The minimum shift design problem
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
• A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem

This page was built for publication: A successful three-phase metaheuristic for the shift minimization personal task scheduling problem