Automated Cellule Technique for Timetable Problem
Abstract
In this paper we try to engage with one of the famous educational problems. A timetable is a combinatorial optimization problem where there are a lot of suggested solutions proposed for a weekly table and authors for a semester. This type of problem is a dynamic. The purpose of these solutions is to escape from the clashes that exist frequently. Here we are going to present one technique with which we try to solve this problem. Our technique is an automaton cell. With this technique, we will use a matrix to distribute the courses. Our matrix is a two-dimensional table. Probabilistic method to escape from clashes. This technique works with some roles that control the cell in the network.
Full text article
References
[1]-Solving university timetabling problems using advanced genetic algorithms, Spyros Kazarlis, Vassilios Petridis, Pawlina Fragkou, Aristotle university of Thessaloniki, Technological Educational institute of Serres, Greece.
[2]-Solving university course timetabling problems using construction swarm optimization with local search, Ruey_Mawchen and hstofangshih, department of computer science and information engineering, national chinyi university of technology, Taichung, Taiwan, ssw 1999-4893, 2013.
[3]-Interactively solving school timetabling problems using extensions of constraint programming, Hadrien combazard, Fabien Demazean, Narendra Jussien and Philippe David, Ecole des Mines de Nantes, LINACNRS, Nantes cedex3, France.
[4]-An introduction to timetabling, D. De WERRA, swiss federal institute of technology, Department of mathematic, ch-115, Lausanne, Switzerland.
[5]-Agraph-based hyper heuristic for educational timetable problems, Edmund K Burke, Barry Mccollum, Amnon Meisels, Sanja Petrovic, Rong qu, Autmated scheduling ooptimization & plamming grup, university of Nottingham NG8 1bb, uk, school f computer science, queen's university Belfast, Belfast BT7 1NN, uk, Dpartement of computer science, Ben Gurion university, Beer-sheva 84105, Israel, Eurpean journal of operational research, 176: 177-12, 2007.
[6]-Maristella Agosti, Fabio Crestani and Massimo Mellucci [1997], on the use of information retrieval techniques for the automatic construction of hypertext, Information Processing & Management, Vol. 33, No. 2, pp. 133-144, 1997.
[7]-Albert0 Aimar a, James Casey b, Nikos Drakos ‘, Ian Hannell a, Arash Khodabandeh a, Paolo Palazzi a, Bertrand Rousseau a, Mario Ruggier, Web Linker [1995], a tool for managing WWW cross-references, Computer Networks and ISDN Systems 28 (1995) 99-105.
[8]-Tao-min Cheng, Chung-wei Feng[2003], An effective simulation mechanism for construction operation, Automation in construction, Volume 12, Issue 3, May 2003, pages 227-244.
[9]-Stephen Van Dulken [1999], Free Patent databases on the internet: a critical view, World Patent Information, Volume 21, Issue 4, December 1999, Pages 253-257.
[10]-Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran [2008], Fundamentals of Computer Algorithms. Universities Press(2ndEdition) India 2008.
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.