Iterative restart technique for solving timetabling problems.

DOI10.1016/S0377-2217(03)00097-3zbMath1053.90040MaRDI QIDQ1417483

Eliezer Kaplansky, Amnon Meisels

Publication date: 5 January 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Constraint networksEmployee timetabling

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A mixed-integer mathematical modeling approach to exam timetabling ⋮ Distributed personnel scheduling -- negotiation among scheduling agents

Cites Work

• Unnamed Item
• Unnamed Item
• Modelling and solving employee timetabling problems
• Constraint tightness and looseness versus local and global consistency
• CSPs with counters: a likelihood-based heuristic
• A memetic approach to the nurse rostering problem

This page was built for publication: Iterative restart technique for solving timetabling problems.