Solving rostering tasks as constraint optimization

DOI10.1007/3-540-44629-X_12MaRDI QIDQ2779810zbMATH OpenFDO

Authors Harald Meyer auf'm Hofe

Publication date 15 April 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2079/20790191

zbMATH Keywords

employee timetabling, artificial intelligence, commercial packages, local search, soft computing, constraint based methods

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies
• A greedy-based neighborhood search approach to a nurse rostering problem.
• Towards a practical engineering tool for rostering
• Nurse rostering at a Danish ward
• The nurse rostering problem: a critical appraisal of the problem structure

Cited in

(14)

• A comparison of two approaches to nurse rostering problems
• A general approach to the physician rostering problem
• Towards a practical engineering tool for rostering
• A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
• A branch-and-price approach for integrating nurse and surgery scheduling
• Generating labor requirements and rosters for mail handlers using simulation and optimization
• New approaches to nurse rostering benchmark instances
• Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies
• Formulation and solution of the drum-buffer-rope constraint scheduling problem ( DBRCSP)
• Nurse rostering using constraint programming and meta-level reasoning
• Nurse rostering at a Danish ward
• Abstraction in constraint optimization problems
• Planning working time accounts under demand uncertainty
• Cyclic preference scheduling of nurses using a Lagrangian-based heuristic

This page was built for publication: Solving rostering tasks as constraint optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2779810)