Automat cellule technique for Timetable problem
Abstract
In this paper we try engage to one of the famous educational problem. A timetable is a combinatorial optimization problem where there are allot of suggested solutions proposed for weekly table and authors for semester. This type of problem is a dynamic. The purpose from these solutions to escape from the clashes that exist frequently. here we going to present one technique with which we try to solve this problem. Our technique is an automat cellule. With this technique we will use a matrix to distribute the courses. Our matrix is a two dimension table. Probabilistic method to escape from clashes. This technique work with some roles which controls the cellule in the network.
Full text article
Authors
This work is licensed under a Creative Commons Attribution 4.0 International License.
In a brief statement, the rights relate to the publication and distribution of research published in the journal of the University of Sebha where authors who have published their articles in the journal of the university of Sebha should how they can use or distribute their articles. They reserve all their rights to the published works, such as (but not limited to) the following rights:
- Copyright and other property rights related to the article, such as patent rights.
- Research published in the journal of the University of Sebha and used in its future works, including lectures and books, the right to reproduce articles for their own purposes, and the right to self-archive their articles.
- The right to enter a separate article, or for a non-exclusive distribution of their article with an acknowledgment of its initial publication in the journal of Sebha University.
Privacy Statement The names and e-mail addresses entered on the Sabha University Journal site will be used for the aforementioned purposes only and for which they were used.