|
Title:
|
SLOTS ? A MODELING LANGUAGE FOR SCHEDULING PROBLEMS |
|
Author(s):
|
Thomas Scheidl, Günther Blaschek, Peter Feigl, Norbert Lebersorger |
|
ISBN:
|
978-972-8939-30-4 |
|
Editors:
|
Hans Weghorn, Pedro Isaías and Radu Vasiu |
|
Year:
|
2010 |
|
Edition:
|
Single |
|
Keywords:
|
Optimization, scheduling problems. |
|
Type:
|
Full Paper |
|
First Page:
|
53 |
|
Last Page:
|
60 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
In this paper, we describe SLOTS, a domain-specific modeling language for specifying scheduling problems. SLOTS allows the modeling of scheduling problems by defining, extending and redefining classes and attributes. A SLOTS specification not only describes the general structure of the problem, but also defines the format of the input data for particular problem instances. |
|
|
|
|
|
|
