Modelling and solving employee timetabling problems
From MaRDI portal
Publication:1397236
DOI10.1023/A:1024460714760zbMath1045.68124OpenAlexW1511711199MaRDI QIDQ1397236
Publication date: 27 July 2003
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1024460714760
Searching and sorting (68P10) Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (13)
Near-optimal MIP solutions for preference based self-scheduling ⋮ Generalizing Global Constraints Based on Network Flows ⋮ A constraint-based approach for the shift design personnel task scheduling problem with equity ⋮ Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem ⋮ First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ Iterative restart technique for solving timetabling problems. ⋮ A comparison of three heuristics on a practical case of sub-daily staff scheduling ⋮ Alternative MIP formulations for an integrated shift scheduling and task assignment problem ⋮ Distributed personnel scheduling -- negotiation among scheduling agents ⋮ A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem ⋮ A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem ⋮ Solving the general employee scheduling problem
This page was built for publication: Modelling and solving employee timetabling problems
