Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

EOR
2011

favoriteEmaildiscussreport

131views more EOR 2011»

Personnel scheduling: Models and complexity

12 years 7 months ago

Personnel scheduling: Models and complexity

Download www.cs.nott.ac.uk

Due to its complexity, its challenging features, and its practical relevance, personnel scheduling has been heavily investigated in the last few decades. However, there is a relatively low level of study on models and complexity in these important problems. In this paper, we present mathematical models which cover speciﬁc aspects in the personnel scheduling literature. Furthermore, we address complexity issues by identifying polynomial solvable and NP-hard special cases.

Peter Brucker, Rong Qu, Edmund K. Burke

Real-time Traffic

Complexity Issues | EOR 2011 | Mathematical Models | Optimization | Solvable |

claim paper

Related Content

» Distributed personnel scheduling negotiation among scheduling agents

» A HistoryBased Automatic Scheduling Model for Personnel Risk Management

» Minimum Dissatisfaction Personnel Scheduling

» Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling

» Sequencing and Counting with the multicostregular Constraint

» Simulation tool for manpower forecast loading and resource leveling

» A SimulationBased Finite Capacity Scheduling System

» Towards a practical engineering tool for rostering

» Developing a Mobile ServiceBased Augmented Reality Tool for Modern Maintenance Work

Post Info
More Details (n/a)

Added	27 Aug 2011
Updated	27 Aug 2011
Type	Journal
Year	2011
Where	EOR
Authors	Peter Brucker, Rong Qu, Edmund K. Burke

Comments (0)