𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposing and Solving Timetabling Constraint Networks

✍ Scribed by Amnon Meisels; Jihad Ell-sana; Ehud Gudes

Book ID
108507785
Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
155 KB
Volume
13
Category
Article
ISSN
0824-7935

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Combining rules and constraints for empl
Combining rules and constraints for employee timetabling
✍ Amnon Meisels; Ehud Gudes; Gadi Solotorevsky πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 143 KB

Employee Timetabling Problems (ETP) are all around us. One possible approach for solving ETPs is to use constraint processing techniques. Another approach is to model human knowledge which is commonly used for solving such problems into knowledgebased systems for timetabling. It is difficult to repr

Solving a timetabling problem using hybr
Solving a timetabling problem using hybrid genetic algorithms
✍ Lars Vestergaard Kragelund πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 179 KB πŸ‘ 2 views

All over the world, human resources are used on all kinds of different scheduling problems, many of which are time-consuming and tedious. Scheduling tools are thus very welcome. This paper presents a research project, where Genetic Algorithms (GAs) are used as the basis for solving a timetabling pro

On node constraint networks
On node constraint networks
✍ Heinz GrΓΆflin πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 327 KB