Timetable manager based on multidimensional array solving algorithm

Abstract

Multi-index assignment problems were introduced as a natural extension of linear assignment problems. It seems that this would be a new branch of methods that could be used for solving Multi Index Assignment Problems. In this study, a method is introduced to solve the multi index assignment problems, where the method is very similar to Hungarian method. The name “Multidimensional Array Solving Algorithm” (MASA) is used for the algorithm presented here. As the name implies the method could be used to solve problems related to multi-dimensional assignment problems. This method would be very useful when applying to practical computing problems. Even though the example is used for a three dimensional assignment problem, it could be extended to higher order assignment problems and applied to many situations with slight modifications. However, this part is not studied yet and may have lot of different variations. MASA is also used to develop the algorithm of the software developed under the project. The database desktop application named as the timetable manager is developed with use of object oriented programming. The same application is applied to solve the example. Depending on the number of resources or objects in a dimension, the solving time would increase rapidly. However, due to line and matrix operations, the running time possibly could be reduced.