Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 5th International Conference on Genetic Algorithms
Methods to Evolve Legal Phenotypes
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Heuristic Combination Method for Solving Job-Shop Scheduling Problems
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Hi-index | 0.00 |
We present the application of the generic framework evAlloc for the solution of allocation and scheduling problems (ASPs) to a real-world problem. The solution engine integrated in the framework is based on an evolutionary algorithm (EA). The general design of the Java framework allows for application to all ASPs, whose problem data description can be fit into the generic data representation of evAlloc. The framework can be transformed into different applications by loading single XML (extended markup language) problem definition files. Experimental results for the real-world application, timetabling of the complete teaching activities at the Institute for Drama at the Mozarteum University of Music and Dramatic Arts in Salzburg, Austria, are presented.