Where academic tradition
meets the exciting future

Solving Challenging Real-World Scheduling Problems

Jari Kyngäs, Solving Challenging Real-World Scheduling Problems. TUCS Dissertations 140. Turku Centre for Computer Science, 2011.


This work contains a series of studies on the optimization of three real-world scheduling problems, school timetabling, sports scheduling and staff scheduling. These challenging problems are solved to customer satisfaction using the proposed PEAST algorithm. The customer satisfaction refers to the fact that implementations of the algorithm are in industry use.

The PEAST algorithm is a product of long-term research and development. The first version of it was introduced in 1998. This thesis is a result of a five-year development of the algorithm. One of the most valuable characteristics of the algorithm has proven to be the ability to solve a wide range of scheduling problems. It is likely that it can be tuned to tackle also a range of other combinatorial problems.

The algorithm uses features from numerous different metaheuristics which is the main reason for its success. In addition, the implementation of the algorithm is fast enough for real-world use.


Full publication in PDF-format

BibTeX entry:

  title = {Solving Challenging Real-World Scheduling Problems},
  author = {Kyngäs, Jari},
  number = {140},
  series = {TUCS Dissertations},
  school = {Turku Centre for Computer Science},
  year = {2011},
  ISBN = {978-952-12-2634-2},

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)

Edit publication