Instance space analysis for a personnel scheduling problem

DOI10.1007/s10472-020-09695-2OpenAlexW3019160814MaRDI QIDQ2043438

Kate A. Smith-Miles, Lucas Kletzander, Nysret Musliu

Publication date: 2 August 2021

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-020-09695-2

zbMATH Keywords

combinatorial optimizationalgorithm selectionpersonnel schedulinginstance space

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

A General Branch-and-Cut Framework for Rotating Workforce Scheduling ⋮ Instance space analysis and algorithm selection for the job shop scheduling problem ⋮ The international timetabling competition on sports timetabling (ITC2021) ⋮ Relating instance hardness to classification performance in a dataset: a visual approach

Cites Work

• Towards objective measures of algorithm performance across instance space
• Generating new test instances by evolving in instance space
• Rotating schedules
• Efficient generation of rotating workforce schedules
• Solver independent rotating workforce scheduling
• Instance spaces for machine learning classification
• Measuring instance difficulty for combinatorial optimization problems
• On the complexity of manpower shift scheduling
• Counting and enumerating feasible rotating schedules by means of Gröbner bases
• The art and science of designing rotating schedules
• Branch-and-Price for Personalized Multiactivity Tour Scheduling
• A general multi-shift scheduling system
• Random forests

This page was built for publication: Instance space analysis for a personnel scheduling problem