Scheduling algorithms

OData support
Supervisor:
Dr. Kővári Bence András
Department of Automation and Applied Informatics

Nowadays planning ahead plays a center role in everyday life. For companies, work scheduling is a planning task that means a bigger challenge for corporations with many employees. The designed schedule has to manage the constantly changing needs of the composition of labor, and also has to be in conformity with the complicated stipulations of the law. Scheduling by hand can only be performed when the headcount is low, in other cases an automated method is needed in order to support it. For this problem, computers come to hand, for they are capable of handling complex problems that cannot be solved by a human. In addition, the quality of the outcome is good and the process is cheap.

Scheduling is a very hard problem to solve even with the use of computers. The calculation of all potential solutions is not possible because of unlimited variations. So that we have to make more efficient algorithms. The scientific literature mentions some algorithms for this problem, but none of them fits all the given requirements.

The Department of Automation and Applied Informatics began to develop an own scheduling algorithm using the .NET framework. This framework can provide support for efficient development even in case of complex tasks.

The first part of my thesis introduces the challenges of scheduling. It is followed by the overview and evaluation of existing solutions. I also introduce the evolution of the approach used at my department and our own framework used for the development. It is followed by the discussion of the extension possibilities of the algorithm. At the end of my thesis I assess the performance of the program, and according to the results optimization is carried out.

Downloads

Please sign in to download the files of this thesis.