Updated Website Announcement

Dear PATAT community,

The PATAT community was launched in the wake of the first international conference on the Practice and Theory of Automated Timetabling in 1995 (PATAT'95). Ever since, the interest group has flourished and memberships have steadily increased.

We are pleased to announce the release of a new website (patat.cs.kuleuven.be) and a new mailing list (watt@ls.kuleuven.be). From now on, these channels will be used to spread timetabling news in the community and beyond!

The PATAT website promotes community interactions, updating members with news from the world of timetabling research. Members can add event notifications, reference datasets of timetabling problems as well as inform the community about their results in any timetabling area, directly from the website. As before, the website enables members to discover and contact other WATT members with similar research interests.

To transition from the previous to the new website and to get an overview of the active memberships, we require both former and newcoming members to register. People wishing to become or remain a member should register here.

Thank you for your cooperation.

For additional information or to communicate any issues relating to the website or working group, please contact watt@cs.kuleuven.be

-- The PATAT team

Comments

Rhyd Lewis's picture

Hi all, Thought you would like to know about my recent paper on timetabling problems and search space connectivity.

Lewis, R. and J. Thompson (2015) 'Analysing the Effects of Solution Space Connectivity with an Effective Metaheuristic for the Course Timetabling Problem'. European Journal of Operational Research, vol. 240, pp. 637-648..

The paper also uses an algorithm that is able to produce state of the art instances across a set of benchmark problem instances used in ITC 2007, the 2nd International Timetabling Competition.

Copies of the paper can be found here: http://rhydlewis.eu/papers/EJOR-TT-RLJT.pdf

Cheers

Rhyd Lewis

Rhyd Lewis's picture

Call for Abstracts for the *Timetabling and Scheduling* Stream at OR58: The 58th Annual Conference in Operational Research, to be held at the University of Portsmouth, England, from the 6th to the 8th of September 2016.

We invite submissions concerned with any aspect of research related to timetabling and scheduling. We particularly recognize that many timetabling and scheduling problems feature problem-structures arising in other areas of operational research such as graph theory, routing, packing, cutting, and partitioning problems. Hence we also welcome any submissions from these problem areas where applicable. Potential submission topics include:

*   Algorithms for timetabling and scheduling in any field (e.g. education, transport, entertainment, health, industry, sports)
*   Algorithms for problems related to timetabling (including routing, cutting, packing, graph colouring, and partitioning);
*   Problem, constraint, and algorithm analysis;
*   Practical issues related to timetabling and their associated problems;
*   The ability of timetables and schedules to withstand changes (i.e., robustness).

All abstracts should be submitted via the Operational Research Society website at http://www.theorsociety.com/Pages/Conferences/OR58/OR58.aspx. Further information on the steam can be found here: http://www.theorsociety.com/Pages/Conferences/OR58/streams/time.aspx. Further guidelines on submissions can also be found here: http://www.theorsociety.com/DocumentRepository/Browse.aspx?DocID=691&drct=true

DATES
30 June 2016: Deadline for early registration fee:
18 July 2016: Deadline for registration if paper to be scheduled for presentation
06 Sep. 2016: Conference