You are here

Synthesis of Local Search models for scheduling applications

The goal of this work is to automatically generate appropriate local search models for various scheduling problems. The generation covers the neighbourhood and the metaheuristic. It is based on a static analysis of the problem at work. The problems are presented using modelling facilities constructed on top of the Comet programming language.