|
Title:
|
RICH INTERNET APPLICATION FOR SIMPLIER TIMETABLING |
|
Author(s):
|
Florent Devin, Yannick Le Nir, Peio Loubière |
|
ISBN:
|
978-972-8939-40-3 |
|
Editors:
|
Piet Kommers, Nik Bessis and Pedro Isaías |
|
Year:
|
2011 |
|
Edition:
|
Single |
|
Keywords:
|
Rich Internet Application (RIA), Timetabling, Constraint Satisfaction Problem (CSP). |
|
Type:
|
Full Paper |
|
First Page:
|
120 |
|
Last Page:
|
126 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Timetable design is a really important and difficult task. Making timetables by hand is very time-consuming. In this paper we present a new software for providing an efficient tool for timetabling. We address two main difficulties of automatic timetabling, which are data acquisition and timetable computation. The former task is made using new advanced technologies in the area of Rich Internet Application (RIA). This offers very powerful, and easy to use, interfaces to acquire data. The latter task is the computation of the timetable itself. After presenting our model, we also present our implementation. The RIA was written in ZK, and for the solver we use the constraint programming and one implementation in swi-prolog. Finally we show our application on a real case study |
|
|
|
|
|
|
