Print

Print




[cid:part1.09010504.04040301@qub.ac.uk]


MISTA 2013: Special Track on EDUCATIONAL TIMETABLING

27-30 August 2013, Gent, Belgium
Submission deadline: January 31st, 2013
http://www.schedulingconference.org/sessions


MISTA 2013 is the sixth in the conference series. The conference serves as a forum for an international community of researchers, practitioners and vendors on all aspects of multi-disciplinary scheduling.

This time round, papers relating to the theory and practice of educational timetabling will be dealt with in a separate track. Papers submitted will be handled by Barry McCollum and Hana Rudova who will lead the track.

Building on the PATAT series of conferences, the timetabling community concentrates on educational timetabling problems coming from universities, colleges or high schools. Over this past number of decades a wide range of papers have been published within the area of educational timetabling. The emphasis within this research field is to document and report on approaches that have been or are being practically applied within a university, school or department. This would be also the main intent of the current track: come up with theoretical or practical approaches which can extend through to a practical solution. The aim is to bring together scheduling researchers and practitioners from all the disciplines that engage with educational timetabling research.

There is a special issue of the Journal of Scheduling associated with this conference. If you present a paper or abstract at the conference, you will be invited to submit a paper to this special issue. More details can be found on the web site.

The track will cover, but not be limited to, the following areas of educational timetabling


 *   University Course Timetabling
 *   High School Timetabling
 *   Examination Timetabling
 *   Student Scheduling
 *   Teacher Assignment
 *   Meeting Timetabling


 *   Modelling
 *   Search-based Approaches
 *   Heuristics
 *   Exact Method Approaches
 *   Real World Implementations
 *   Commercial Approaches


The scope of the MISTA conference includes (but is not limited to):

 *   Agent Based Scheduling
 *   Algorithmics
 *   Applications
 *   Automated Reasoning
 *   Batch Scheduling
 *   Commercial Packages
 *   Complexity of Scheduling Problems
 *   Constraint Logic Programming
 *   Delivery Scheduling
 *   Evolutionary Algorithms
 *   Heuristic Search
 *   Knowledge-Based Systems
 *   Large Scale Scheduling
 *   Local Search
 *   Machine Scheduling
 *   Meta-heuristic Search
 *   Multi-processor Scheduling
 *   Process Scheduling
 *   Production Scheduling
 *   Real World Scheduling
 *   Real-Time Scheduling
 *   Rostering
 *   Rule-Based Expert Systems
 *   Shop-Floor Scheduling
 *   Sports Scheduling
 *   Theoretical Scheduling
 *   Timetabling
 *   Transport Scheduling
 *   Vehicle Routing

Deadlines

31st Jan 2013: Deadline submission
15th Apr 2013: Decision to authors
31st May 2013: Early registration due
31st May 2013: Camera ready papers due

Submission Details

Authors are invited to submit papers in one of two categories

(a) Full Papers
There is no page limit but the reviewers will be asked to comment (if necessary) on the length of the paper. These papers will be will be accepted as full papers at the conference.

(b) Extended Abstracts
These shorter papers (try to limit to 3 pages) will give you the opportunity to present your work at the conference. The abstracts will also appear in the conference proceedings.

Both categories of papers will be invited to submit suitably revised and extended versions to a post conference issue of the Journal of Scheduling.

Formatting Guidelines

Both Word templates and Latex styles are available from the web site. We will only accept PDF files that have been formatted using these formatting styles.











Your privacy is important to us - if you believe that you've received this communication in error, or would prefer not to receive future communications, please reply to this email with the word 'unsubscribe' in the message header.