Modelling Timetabling Problems with STTL

نویسنده

  • Jeffrey H. Kingston
چکیده

STTL is a language for specifying and evaluating timetabling problems, instances, and solutions. An interpreter for STTL is freely available on the Internet. After a brief overview of the language, this paper explores the issues involved in applying STTL to real-world problems,using high school timetabling as a case study.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A User’s Guide to the STTL Timetabling Language

This paper presents STTL, a language for communicating, storing, and evaluating timetabling problems, instances, and solutions. An interpreter for STTL is freely available on the Internet.

متن کامل

STTL: A Standard Timetabling Language (DRAFT)

This paper presents STTL, a language for communicating, storing, and evaluating timetabling problems, instances, and solutions. An interpreter for STTL is freely available on the Internet. The paper also includes a case study of high school timetabling.

متن کامل

An Extensible Modelling Framework for the Examination Timetabling Problem

A number of modelling languages for timetabling have been proposed to standardise the specification of problems, solutions and their data formats. These languages have not been adopted as standard due to not simplifying the modelling process, lack of features and offering little advantage over traditional programming languages. In contrast to this approach we propose a new language-independent ...

متن کامل

Integrated Modelling

Planning, scheduling, and timetabling problems are typically solved using different techniques despite the fact that all these areas seem very similar and they are definitely connected. In this paper we propose a generic model covering scheduling and timetabling problems as well as some problems from planning under time and resource constraints. Our model is motivated by reallife problems and o...

متن کامل

A Language for Specifying Complete Timetabling Problems

The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a number of different versions of the timetabling problem. These include school timetabling (where students are grouped in classes with similar degree plans), university timetabling (where students are considered individu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000