SLOTS - A modeling language for scheduling problems

Thomas Scheidl; Günther Blaschek; Peter Feigl; Norbert Lebersorger

SLOTS - A modeling language for scheduling problems

Thomas Scheidl, Günther Blaschek, Peter Feigl, Norbert Lebersorger

Institute for Systems Software

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

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.

Original language	English
Title of host publication	IADIS International Conference APPLIED COMPUTING 2010
Number of pages	8
Publication status	Published - Oct 2010

Fields of science

102 Computer Sciences
102011 Formal languages

Cite this

@inproceedings{edf103ca115141219424eb88d4d9b340,

title = "SLOTS - A modeling language for scheduling problems",

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.",

author = "Thomas Scheidl and G{\"u}nther Blaschek and Peter Feigl and Norbert Lebersorger",

year = "2010",

month = oct,

language = "English",

booktitle = "IADIS International Conference APPLIED COMPUTING 2010",

}

TY - GEN

T1 - SLOTS - A modeling language for scheduling problems

AU - Scheidl, Thomas

AU - Blaschek, Günther

AU - Feigl, Peter

AU - Lebersorger, Norbert

PY - 2010/10

Y1 - 2010/10

N2 - 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.

AB - 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.

M3 - Conference proceedings

BT - IADIS International Conference APPLIED COMPUTING 2010

ER -