Solving employee timetabling problems by generalized local search

DOI10.1007/3-540-46238-4_33MaRDI QIDQ2729760zbMATH OpenFDO

Authors Andrea Schaerf, Amnon Meisels

Publication date 23 October 2001

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

Full work available at URL https://doi.org/10.1007/3-540-46238-4_33

Mathematics Subject Classification ID

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

Recommendations

• Modelling and solving employee timetabling problems
• Constraint Programming Based Column Generation for Employee Timetabling
• Iterative restart technique for solving timetabling problems.
• Solving the general employee scheduling problem
• Local search for shift design.

Cited in

(10)

• Efficient generation of rotating workforce schedules
• Modelling and solving employee timetabling problems
• Staff scheduling and rostering: a review of applications, methods and models.
• Iterative restart technique for solving timetabling problems.
• Joint employee weekly timetabling and daily rostering: a decision-support tool for a logistics platform
• Solving the general employee scheduling problem
• Distributed personnel scheduling -- negotiation among scheduling agents
• An iterated local search algorithm for a place scheduling problem
• Constraint Programming Based Column Generation for Employee Timetabling
• Applying evolutionary computation to the school timetabling problem: The Greek case

This page was built for publication: Solving employee timetabling problems by generalized local search

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