Optimizing the unlimited shift generation problem

Authors:
Nico Kyngäs;Dries Goossens;Kimmo Nurmi;Jari Kyngäs
Affiliations:
Satakunta University of Applied Sciences, Pori, Finland;KU Leuven, Leuven, Belgium;Satakunta University of Applied Sciences, Pori, Finland;Satakunta University of Applied Sciences, Pori, Finland
Venue:
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
Year:
2012

Citing 6
Cited 0

On the complexity of manpower shift scheduling

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Hyperheuristic Approach to Scheduling a Sales Summit

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Modelling and Solving Employee Timetabling Problems

Annals of Mathematics and Artificial Intelligence
A Cost-Regular Based Hybrid Column Generation Approach

Constraints
Retail store workforce scheduling by expected operating income maximization

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Good rosters have many benefits for an organization, such as lower costs, more effective utilization of resources and fairer workloads. This paper introduces the unlimited shift generation problem. The problem is to construct a set of shifts such that the staff demand at each timeslot is covered by a suitable number of employees. A set of real-world instances derived from the actual problems solved for various companies is presented, along with our results. This research has contributed to better systems for our industry partners.