Статті в журналах: "Educational Timetabling"

1

Zhu, Kaixiang, Lily D. Li, and Michael Li. "A Survey of Computational Intelligence in Educational Timetabling." International Journal of Machine Learning and Computing 11, no. 1 (January 2021): 40–47. http://dx.doi.org/10.18178/ijmlc.2021.11.1.1012.

Повний текст джерела

Анотація:

Timetabling problems have been widely studied, of which Educational Timetabling Problem (ETP) is the biggest section. Generally, ETP can be divided into three modules, namely, course timetabling, school timetabling, and examination timetabling. For solving ETP, many techniques have been developed including conventional algorithms and computational intelligence approaches. Several surveys have been conducted focusing on those methods. Some surveys target on particular categories; some tend to cover all types of approaches. However, there are lack of reviews specifically focusing on computational intelligence in ETP. Therefore, this paper aims at providing a reference of selecting a method for the applications of ETP by reviewing popular computational intelligent algorithms, such as meta-heuristics, hyper-heuristics, hybrid methods, fuzzy logic, and multi-agent systems. The application would be categorised and described into the three types of ETP respectively.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Bolaji, Asaju La’aro, Ahamad Tajudin Khader, Mohammed Azmi Al-Betar, and Mohammed A. Awadallah. "Artificial Bee Colony Algorithm for Solving Educational Timetabling Problems." International Journal of Natural Computing Research 3, no. 2 (April 2012): 1–21. http://dx.doi.org/10.4018/jncr.2012040101.

Повний текст джерела

Анотація:

This paper presents an artificial bee colony algorithm (ABC) for Education Timetabling Problem (ETP). It is aimed at developing a good-quality solution for the problem. The initial population of solutions was generated using Saturation Degree (SD) and Backtracking Algorithm (BA) to ensure the feasibility of the solutions. At the improvement stage in the solution method, ABC uses neighbourhood structures iteratively within the employed and onlooker bee operators, in order to rigorously navigate the UTP search space. The technique was evaluated using curriculum-based course timetabling (CB-CTT) and Uncapacitated Examination Timetabling Problem (UETP) problem instances. The experimental results on UETP showed that the technique is comparable with other state-of-the-art techniques and provides encouraging results on CB-CTT.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Fonseca, George H. G., Haroldo G. Santos, Eduardo G. Carrano, and Thomas J. R. Stidsen. "Integer programming techniques for educational timetabling." European Journal of Operational Research 262, no. 1 (October 2017): 28–39. http://dx.doi.org/10.1016/j.ejor.2017.03.020.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Haitan, О., and О. Nazarov. "HYBRID APPROACH TO SOLVING OF THE AUTOMATED TIMETABLING PROBLEM IN HIGHER EDUCATIONAL INSTITUTION." Системи управління, навігації та зв’язку. Збірник наукових праць 2, no. 60 (May 28, 2020): 60–69. http://dx.doi.org/10.26906/sunz.2020.2.060.

Повний текст джерела

Анотація:

The paper describes a hybrid approach to solving of the automated timetabling problem in higher educational institution based on the ant colony optimization, the genetic algorithm, and the Nelder–Mead method. The ant colony method is the basis of this algorithm, which forms the initial population for the genetic algorithm. The combination of this method with the genetic algorithm and the Nelder–Mead method reduces time of the convergence of an algorithm and eliminates the strong dependence of the results on the initial search parameters, which usually are selected experimentally. The Nelder–Mead method is used to find the parameters of the ant colony optimization method. Use of the genetic algorithm allows for reducing of algorithm running time and increasing of global optimum finding probability. The educational process timetabling in higher school is an important component of the educational process assurance system, since the schedule quality determines the comfort of the educational process participants and its quality and effectiveness. Therefore, the development of methods for computer-aided timetable generation is an important challenge. The subject of study is adaptive methods of automated university timetabling. The objective of the work is development of a hybrid approach to addressing the problem of automated timetabling in university. The results are development and research of a hybrid method and software for university timetabling that been implemented this method

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Shadkam, Elham. "An integer mathematical model for the problem of timetabling university exams." BEN Vol:2 Issue:3 2021 2, no. 3 (February 27, 2021): 11–15. http://dx.doi.org/10.36937/ben.2021.003.003.

Повний текст джерела

Анотація:

This research is an attempt to create optimized planning in educational units. The problem of university courses timetabling is one of the problems that is very important for educational units; establishing optimal distances to comply with students' study status as well as balancing other constraints of the timetabling problem is one of the challenges in a timetabling problem. Therefore, sometimes an educational unit may not be able to strike a good balance between all the constraints it faces and fail to achieve a proper timing table. In this paper, in order to achieve optimal exam timetabling with an integer scheduling approach, a model for exam timetabling is presented. The purpose of the proposed mathematical model is to maximize the appropriate time intervals that should be established between students' exams. In this mathematical model, according to the number of allowed exam days and the number of possible exam sessions per day, a number of positions have been considered and it is tried to assign these positions to the courses according to the courses related to the students of each entrance. The most important advantage of the proposed model is its simplicity while sufficient accuracy. Therefore, complex methods are not needed to solve this model.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

de la Rosa-Rivera, Felipe, Jose I. Nunez-Varela, José C. Ortiz-Bayliss, and Hugo Terashima-Marín. "Algorithm selection for solving educational timetabling problems." Expert Systems with Applications 174 (July 2021): 114694. http://dx.doi.org/10.1016/j.eswa.2021.114694.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Mazlan, Munirah, Mokhairi Makhtar, Ahmad Firdaus Khair Ahmad Khairi, Mohamad Afendee Mohamed, and Mohd Nordin Abdul Rahman. "Ant colony optimisation for solving university course timetabling problems." International Journal of Engineering & Technology 7, no. 2.15 (April 6, 2018): 139. http://dx.doi.org/10.14419/ijet.v7i2.15.11371.

Повний текст джерела

Анотація:

Course timetabling is one of the most important activities faced by any educational institution. Furthermore, the course timetabling process is time-consuming and tiresome as it needs to be prepared for each regular semester. This paper aims to apply the Ant Colony Optimisation (ACO) method to solve the course timetabling problem. This approach is to optimise the properties of the course requirement and minimise various conflicts for the time slot assignation. This method is based on the life of the ant colony in generating automatic timetabling according to the properties (pheromones) such as time, student, lecturer and room, besides satisfying the constraints. The implementation of this method is to find an effective and better solution for university course timetabling. The result and performance evaluation is used to determine whether it is reliable in providing the feasible timetable.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Mazlan, Munirah, Mokhairi Makhtar, Ahmad Firdaus Khair Ahmad Khairi, Mohamed Afendee Mohamed, and Mohd Nordin Abdul Rahman. "A study on optimization methods for solving course timetabling problem in university." International Journal of Engineering & Technology 7, no. 2.14 (April 6, 2018): 196. http://dx.doi.org/10.14419/ijet.v7i2.14.12824.

Повний текст джерела

Анотація:

Course timetabling is one of the most important processes faced by any educational institution. However, the course timetabling process is time consuming and tiresome as it needs to be done for each regular semester. This paper aims to study on the Optimization methods to solve the course timetabling problem. The study is obtained and discussed by categorizing between the classification of Hard Constraint and Soft Constraint and the classification of Optimization Methods. From the study, it shows that Meta-Heuristics are the mostly method used in solving the course timetabling problem. It is concluded that this method is suitable for future used compared to other techniques studied. An analysis and observation will be carried out for the research future.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Ma, Xin Min, and Lin Li Wu. "Research on Timetabling Problems Based on Particle Swarm Optimization Algorithm." Advanced Engineering Forum 6-7 (September 2012): 736–41. http://dx.doi.org/10.4028/www.scientific.net/aef.6-7.736.

Повний текст джерела

Анотація:

A new algorithm for timetabling based on particle swarm optimization algorithm was proposed, and the key problems such as particle coding, fitness function fabricating, particle swarm initialization and crossover operation were settled. The fitness value declines when the evolution generation increases. The results showed that it was a good solution for course timetabling problem in the educational system.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Zhu, Kaixiang, Lily D. Li, and Michael Li. "School Timetabling Optimisation Using Artificial Bee Colony Algorithm Based on a Virtual Searching Space Method." Mathematics 10, no. 1 (December 26, 2021): 73. http://dx.doi.org/10.3390/math10010073.

Повний текст джерела

Анотація:

Although educational timetabling problems have been studied for decades, one instance of this, the school timetabling problem (STP), has not developed as quickly as examination timetabling and course timetabling problems due to its diversity and complexity. In addition, most STP research has only focused on the educators’ availabilities when studying the educator aspect, and the educators’ preferences and expertise have not been taken into consideration. To fill in this gap, this paper proposes a conceptual model for the school timetabling problem considering educators’ availabilities, preferences and expertise as a whole. Based on a common real-world school timetabling scenario, the artificial bee colony (ABC) algorithm is adapted to this study, as research shows its applicability in solving examination and course timetabling problems. A virtual search space for dealing with the large search space is introduced to the proposed model. The proposed approach is simulated with a large, randomly generated dataset. The experimental results demonstrate that the proposed approach is able to solve the STP and handle a large dataset in an ordinary computing hardware environment, which significantly reduces computational costs. Compared to the traditional constraint programming method, the proposed approach is more effective and can provide more satisfactory solutions by considering educators’ availabilities, preferences, and expertise levels.

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Ogris, Vid, Tomaž Kristan, Andrej Škraba, Marko Urh, and Davorin Kofjač. "iUrnik: Timetabling for Primary Educational Institutions in Slovenia." Interfaces 46, no. 3 (June 2016): 231–44. http://dx.doi.org/10.1287/inte.2016.0846.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Pillay, Nelishia. "A review of hyper-heuristics for educational timetabling." Annals of Operations Research 239, no. 1 (August 9, 2014): 3–38. http://dx.doi.org/10.1007/s10479-014-1688-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Sakaliuk, O., and F. Trishyn. "ANALYSIS OF PROCESS CREATION OF THE COURSES TIMETABLING." Automation of technological and business processes 11, no. 2 (June 26, 2019): 30–35. http://dx.doi.org/10.15673/atbp.v11i2.1370.

Повний текст джерела

Анотація:

The organization of education for persons who are studying is carried out in accordance with the coursestimetabling. Courses timetabling should provide an effective implementation of the curriculum in full.The problem of creating the courses timetabling has been given sufficient attention during the last decades. But even today,the process of creating the courses timetabling requires a fairly large part of human control. The typical problem of creatingthe courses timetabling is to plan a set of meetings between teachers and students over a period of time that requires someresources and should meet some additional requirements. Significant requirements in scheduling are those in which theteacher, student, or audience is not used more than once at the one-time interval. Creating the courses timetabling ininstitutions of higher education is carried out every semester. Preparing the timetabling of the courses is a labor-intensive,tedious process that requires a significant amount of human resources and time.In this scientific article, an analysis of process creation of the courses timetabling is carried out. In the course of work areinvestigated basic guidance documents for the creation of the courses timetabling. On the basis of controlled observation,where the observer was included in the process and conducted in real conditions, on the basis of the dispatch of educationaldepartment of the Odessa National Academy of Food Technologies, the process of creation of the courses timetabling isdescribed, and the main structures of the institution of higher education, which are involved, are determined. On the basis ofcontrolled observation, where the observer was included in the process and conducted in real conditions, on the basis of thedispatch section of educational department of the Odessa National Academy of Food Technologies, the process of creation ofthe courses timetabling is described, and the main structures of the institution of higher education, which are involved, aredetermined. Constraints which must be observed during the process are divided into hard and soft. Actual solutions areinvestigated, such as: genetic algorithm, greedy algorithm, graph coloring method, method of logical programming withconstraints, etc. Describes what determines the performance of these methods and algorithms.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

N, Buvaneswari, and Rekha S. "Timetable Scheduling using Bipartite Graph." International Journal for Research in Applied Science and Engineering Technology 10, no. 12 (December 31, 2022): 1854–56. http://dx.doi.org/10.22214/ijraset.2022.47641.

Повний текст джерела

Анотація:

Abstract: In any educational institution, the two most common academic scheduling problems are course timetabling and exam timetabling. A schedule is desirablewhich combines resources like teachers, subjects, students, classrooms in a way to avoid conflicts satisfying various essential and preferential constraints. The timetable scheduling problem is known to be NP Complete but the corresponding optimization problem is NP Hard. This problem is solved using bipartite graph. Hence a heuristic approach ispreferred to find a nearest optimal solution within reasonable running time

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Mazlan, Munirah, Mokhairi Makhtar, Ahmad Firdaus Khair Ahmad Khairi, and Mohamad Afendee Mohamed. "University course timetabling model using ant colony optimization algorithm approach." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 1 (January 1, 2019): 72. http://dx.doi.org/10.11591/ijeecs.v13.i1.pp72-76.

Повний текст джерела

Анотація:

<p>Due to the increased number of students and regulations, all educational institutions have renewed their interest to appear in the number of complexity and flexibility since the resources and events are becoming more difficult to be scheduled. Timetabling is the type of problems where the events need to be organized into a number of timeslots to prevent the conflicts in using a given set of resources. Thus in the intervening decades, significant progress has been made in the course timetabling problem monitoring with meta-heuristic adjustment. In this study, ant colony optimization (ACO) algorithm approach has been developed for university course timetabling problem. ACO is believed to be a powerful solution approach for various combinatorial optimization problems. This approach is used according to the data set instances that have been collected. Its performance is presented using the appropriate algorithm. The results are arguably within the best results range from the literature. The performance assessment and results are used to determine whether they are reliable in preparing a qualifying course timetabling process.</p>

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Burke, Edmund K., Barry McCollum, Amnon Meisels, Sanja Petrovic, and Rong Qu. "A graph-based hyper-heuristic for educational timetabling problems." European Journal of Operational Research 176, no. 1 (January 2007): 177–92. http://dx.doi.org/10.1016/j.ejor.2005.08.012.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Pillay, Nelishia, and Ender Özcan. "Automated generation of constructive ordering heuristics for educational timetabling." Annals of Operations Research 275, no. 1 (September 4, 2017): 181–208. http://dx.doi.org/10.1007/s10479-017-2625-x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Sabar, Nasser R., Masri Ayob, Graham Kendall, and Rong Qu. "A honey-bee mating optimization algorithm for educational timetabling problems." European Journal of Operational Research 216, no. 3 (February 2012): 533–43. http://dx.doi.org/10.1016/j.ejor.2011.08.006.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Khair, Ahmad Firdaus, Mokhairi Makhtar, Munirah Mazlan, Mohamad Afendee Mohamed, and Mohd Nordin Abdul Rahman. "An ant colony algorithm for universiti sultan zainal abidin examination timetabling problem." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 1 (January 1, 2019): 191. http://dx.doi.org/10.11591/ijeecs.v13.i1.pp191-198.

Повний текст джерела

Анотація:

The real-life construction of examination timetabling problem is considered as a common problem that always encountered and experienced in educational institution whether in school, college, and university. This problem is usually experienced by the academic management department where they have trouble to handle complexity for assign examination into a suitable timeslot manually. In this paper, an algorithm approach of ant colony optimisation (ACO) is presented to find an effective solution for dealing with Universiti Sultan Zainal Abidin (UniSZA) examination timetabling problems. A combination of heuristic with ACO algorithm contributes the development solution in order to simplify and optimize the pheromone occurrence of matrix updates which include the constraints problem. The implementation of real dataset instances from academic management is applied to the approach for generating the result of examination timetable. The result and performance that obtained will be used for further use to evaluate the quality and observe the solution whether our examination timetabling system is reliable and efficient than the manual management that can deal the constraints problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Alkallak, Isra Natheer, Ruqaya Zedan Shaban, and Yazen Hudhaifa Shakir Alnema. "Intelligent university timetable scheduling system using sudoku grid with magic square." Bulletin of Electrical Engineering and Informatics 11, no. 3 (June 1, 2022): 1526–34. http://dx.doi.org/10.11591/eei.v11i3.3694.

Повний текст джерела

Анотація:

Examination timetabling is problem faced by many academic educational institutions. The situation formulated as artificial intelligence problems as Sudoku grid with Magic square. Problem assigning a set of examinations to a fixed number of examination periods so that no student is required to take more than one examination at a time. The research describes two proposed heuristic algorithms to create university examination timetabling and avoiding the overlapping of exams. We proposed two algorithms, the first algorithm is based on Sudoku grid, a number of hard constraints as well as a number of soft constraints are proposed. We assigned exams as 9 to period as 27 slot times and to 3 rooms, with 3 classes. Each student in each class takes 9 exams While, the second algorithm simulates the classic manual methods while observing the hard and soft constraints of the problem. The heuristic approach used to further optimize the result to include hard constraints with soft. The proposed methodology for creating the Exam timetabling problem has been implemented in Matlab and closing the gap between classical methods and intelligent methods. The results obtained with very less computational effort through two algorithms.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Firdaus Khair, Ahmad, Mokhairi Makhtar, Munirah Mazlan, Mohamad Afendee Mohamed, and Mohd Nordin Abdul Rahman. "Solving examination timetabling problem in UniSZA using ant colony optimization." International Journal of Engineering & Technology 7, no. 2.15 (April 6, 2018): 132. http://dx.doi.org/10.14419/ijet.v7i2.15.11369.

Повний текст джерела

Анотація:

At all educational institutions, timetabling is a conventional problem that has always caused numerous difficulties and demands that need to be satisfied. For the examination timetabling problem, those matters can be defined as complexity in scheduling exam events or non-deterministic polynomial hard problems (NP-hard problems). In this study, the latest approach using an ant colony optimisation (ACO) which is the ant system (AS) is presented to find an effective solution for dealing with university exam timetabling problems. This application is believed to be an impressive solution that can be used to eliminate various types of problems for the purpose of optimising the scheduling management system and minimising the number of conflicts. The key of this feature is to simplify and find shorter paths based on index pheromone updating (occurrence matrix). With appropriate algorithm and using efficient techniques, the schedule and assignation allocation can be improved. The approach is applied according to the data set instance that has been gathered. Therefore, performance evaluation and result are used to formulate the proposed approach. This is to determine whether it is reliable and efficient in managing feasible final exam timetables for further use.

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Guia, Angelita D., and Melvin A. Ballera. "Multi-agent class timetabling for higher educational institutions using prometheus platform." Indonesian Journal of Electrical Engineering and Computer Science 22, no. 3 (June 1, 2021): 1679. http://dx.doi.org/10.11591/ijeecs.v22.i3.pp1679-1687.

Повний текст джерела

Анотація:

<p>A in a university setting, class scheduling is vital for teaching and learning process. Academic institutions rely on time tables in their day to day activities. University Course Timeframe problem can be resolved by using multi-agent systems-based method which may increase the independence of each department's class scheduling, adaptability in a distributed environment and prevents conflicts between events or resources, and unforeseen allocation through intervention between agents in a dispersed environment. Class timing is performed manually in most of the higher educational institutions, which is a very challenging and time-consuming process. The main objective of the study is to build a multi-agent class timing system that automates the process of class scheduling of higher education institutions (HEIs) using the Prometheus methodology. The implementation of the Prometheus approach in the development of a multi-agent framework has resulted in a complete and comprehensive system covering all phases of software development as applied to the agent systems.</p>

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Sakaliuk, O., and F. Trishyn. "USING A GENETIC ALGORITHM TO SOLVE THE COURSES TIMETABLING CREATION PROBLEM." Automation of technological and business processes 13, no. 2 (August 2, 2021): 22–28. http://dx.doi.org/10.15673/atbp.v13i2.2053.

Повний текст джерела

Анотація:

Creating of courses timetable is an extremely difficult, time-consuming task and usually takes a long time. In many educational institutions, the courses schedule is developed manually. Schedule theory includes problems that are actually less complex than problems in practice, but theoretical analysis provides a fundamental understanding of the complexity of the schedule. The logical result is that the schedule is very difficult to build in practice due to many constraints [1]. Scheduling courses is a planning problem. In 1996, the problem of scheduling was described as the allocation of some resources with restrictions on a limited number of time intervals and at the same time to satisfy the set of stated objectives [2]. This is a general statement and is a common description of the courses timetabling creation problem. Schedule of courses is an important administrative activity in most educational institutions. The timetable problem is the distribution of classes by available audiences and time intervals, taking into account the constraints. We usually distinguish between two types of constraints: hard and soft. Hard constraints are compulsorily fulfilled by the educational institution. Decisions that do not violate hard constraints are called possible solutions. With the development of the general theory of the schedule, the approaches to the formalization and solution of the courses timetabling creation problem in educational institutions also changed. Currently, the problem of automation of the courses timetabling creation remains relevant. The urgency of the problem is determined by the growing requirements for the quality of education, student work planning, rational use of the audiences, as well as taking into account additional optimization parameters. The task of finding the optimal schedule of courses in most cases belongs to the class of complex problems. If we take into account the real conditions, the problem is even more complicated, because the desired solutions must meet numerous constraints of production, organizational and psychophysiological nature, which contradict each other. The genetic algorithm helps to efficiently search for optimal solutions in spaces with a very large dimension.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Larabi-Marie-Sainte, Souad, Roohi Jan, Ali Al-Matouq, and Sara Alabduhadi. "The impact of timetable on student’s absences and performance." PLOS ONE 16, no. 6 (June 25, 2021): e0253256. http://dx.doi.org/10.1371/journal.pone.0253256.

Повний текст джерела

Анотація:

Student’s academic performance is the point of interest for both the student and the academic institution in higher education. This performance can be affected by several factors and one of them is student absences. This is mainly due to the missed lectures and other class activities. Studies related to university timetabling investigate the different techniques and algorithms to design course timetables without analyzing the relationship between student attendance behavior and timetable design. This article first aimed at demonstrating the impact of absences and timetabling design on student’s academic performance. Secondly, this study showed that the number of absences can be caused by three main timetable design factors: namely, (1) the number of courses per semester, (2) the average number of lectures per day and (3) the average number of free timeslots per day. This was demonstrated using Educational Data Mining on a large dataset collected from Prince Sultan University. The results showed a high prediction performance reaching 92% when predicting student’s GPA based on absences and the factors related to timetabling design. High prediction performance reaching 87% was also obtained when predicting student absences based on the three timetable factors mentioned above. The results demonstrated the importance of designing course timetables in view of student absence behavior. Some suggestions were reported such as limiting the number of enrolled courses based on student’s GPA, avoiding busy and almost free days and using automated timetabling to minimize the number of predicted absences. This in turn will help in generating balanced student timetables, and thus improving student academic performance.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Arratia-Martinez, Nancy Maribel, Cristina Maya-Padron, and Paulina A. Avila-Torres. "University Course Timetabling Problem with Professor Assignment." Mathematical Problems in Engineering 2021 (January 26, 2021): 1–9. http://dx.doi.org/10.1155/2021/6617177.

Повний текст джерела

Анотація:

One of the decision problems in many organizations and institutions is to decide how to schedule different tasks, in particular, in higher education institutions. One of the main problems is the university course timetabling problem (UCTP): this problem consists of the allocation of events (courses, professors, and students) to a number of fixed time slots and rooms, this at the beginning of each academic period of the universities. The existent formulations include particular requirements from different educational levels and institutions, as in our case. In this paper, we focus on the university course timetabling problem with the assignment of professor-course-time slot for an institution in Mexico. Timetabling is constructed for the disciplinary courses that are offered by one of the academic departments. The main characteristics are as follows: (1) there are full-time and part-time professors; (2) a mandatory fixed number of courses has to be assigned to each full-time professor according to their academic profile; (3) there is a maximum number of courses assigned to part-time professors; (4) a professor-course matrix that specifies the valid assignation is defined; and (5) mandatory time periods for courses in different semesters are established and other traditional constraints. We present the integer linear programming model proposed to solve the case studied. The optimal solution was obtained with low computational effort through the classical branch-and-bound algorithm. We describe the complete timetable to show the model effectiveness.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Nand, Ravneil, Bibhya Sharma, and Kaylash Chaudhary. "An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling." PeerJ Computer Science 8 (September 2, 2022): e1068. http://dx.doi.org/10.7717/peerj-cs.1068.

Повний текст джерела

Анотація:

In recent times, there has been a growing attention to intelligent optimization algorithms centred on swarm principles such as the firefly algorithm (FA). It was proposed for the continuous domain that mimics the attraction of fireflies to flashing light and has been used in discrete domains via modification. A discrete domain that is a major challenge in most higher education institutes (HEI) is examination timetabling. This article presents a new methodology based on FA for uncapacitated examination timetabling problems (UETP) where the proposed method is an extension of earlier work by the authors on the continuous domain. UETP is considered in this article as it is a university examination timetabling problem, which is still an active research area and has not been solved by FA algorithm as per authors knowledge. The proposed method concentrates on solving the initial solution using discrete FA where it consolidates the reordering of examinations and slots through a heuristic ordering known as neighborhood search. Three neighborhoods are employed in this research, where one is used during the initialization phase while two are utilized during solution improvement phase. Later, through preference parameters, a novel stepping ahead mechanism is used, which employs neighborhood searches built on previous searches. The proposed method is tested with 12 UETP problems where the preference based stepping ahead FA creates comparative results to the best ones available in the literature for the Toronto exam timetabling dataset. The results obtained are proof of concept at the preliminary stage and require further experiments on other educational datasets such as the second international timetable competition benchmark sets. The newly introduced preference based stepping ahead mechanism takes advantage of the current best solution space where it exploits the solution space for better solutions. This paves the way for researchers to utilize the mechanism in other domains such as robotics, etc.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Kosolap, A. I., and T. M. Dubovik. "OPTIMIZATION OF TIMETABLE AT THE UNIVERSITY." Radio Electronics, Computer Science, Control, no. 3 (October 9, 2021): 175–83. http://dx.doi.org/10.15588/1607-3274-2021-3-15.

Повний текст джерела

Анотація:

Context. In this paper, we consider a well-known university scheduling problem. Such tasks are solved several times a year in every educational institution. The problem of constructing an optimal schedule remains open despite numerous studies in this area. This is due to the complexity of the corresponding optimization problem, in particular, its significant dimension. This complicates its numerical solution with existing optimization methods. Scheduling models also need improvement. Thus, schedule optimization is a complex computational problem and requires the development of new methods for solving it. Objective. Improvement of optimization models for timetabling at the university and the use of new effective methods to solve them. Method. We use the exact quadratic regularization method to solve timetabling optimization problems. Exact quadratic regularization allows transforming complex optimization models with Boolean variables into the problem of maximizing the vector norm on a convex set. We use the efficient direct dual interior point method and dichotomy method to solve this problem. This method has shown significantly better results in solving many complex multimodal problems. This is confirmed by many comparative computational experiments. The exact quadratic regularization method is even more effective in solving timetabling problems. This optimization method is used for the first time for this class of problems, so it required the development of adequate algorithmic support. Results. We propose a new, simpler timetabling optimization model that can be easily implemented software in Excel with the OpenSolver, RoskSolver, and others. We give a small example of building a schedule and describe step-by-step instructions for obtaining the optimal solution. Conclusions. An efficient new technology developed for university timetable, which is simple to implement and does not require the development of special software. The efficiency of the technology is ensured by the use of a new method of exact quadratic regularization.

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Mokhtari, Mozhgan, Majid Vaziri Sarashk, Milad Asadpour, Nadia Saeidi, and Omid Boyer. "Developing a Model for the University Course Timetabling Problem: A Case Study." Complexity 2021 (December 22, 2021): 1–12. http://dx.doi.org/10.1155/2021/9940866.

Повний текст джерела

Анотація:

Over recent years, timetable programming in academic settings has become particularly challenging due to such factors as the growing number of students, the variety of lectures, the inadequacy of educational facilities in some areas, and the incorporation of teachers and students’ preferences into the schedule. Many researchers, therefore, have been formulating the problem of timetabling lectures using different methods. In this research, a multiobjective mixed-integer programming model was developed to provide a timetable for the postgraduate courses at the Industrial Engineering Department of Islamic Azad University, Najafabad Branch (IAUN). The proposed model minimized the violation of the lecturers and educational priorities, the student travel time between classes, and the classes’ surplus capacity. To convert the multiobjective model into a single one, the ε-constraint method was adopted, and the model’s accuracy and feasibility were examined through a real example solved by the CPLEX solver of GAMS software. The results approved the efficiency of this model in preparing a timetable for university lectures.

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Palma, Cristian D., and Patrick Bornhardt. "Considering Section Balance in an Integer Optimization Model for the Curriculum-Based Course Timetabling Problem." Mathematics 8, no. 10 (October 13, 2020): 1763. http://dx.doi.org/10.3390/math8101763.

Повний текст джерела

Анотація:

University course timetabling is a complex and time-consuming duty that every educational institution faces regularly. It consists of scheduling a set of lectures in predefined time slots so as to avoid student conflicts, meet teacher and room availability, and manage several institution-specific operational rules. In this paper, we schedule courses based on a curriculum, that is, before the students’ registration. Unlike other curriculum-based models, the proposed model considers two practical aspects when managing the conflicts between lectures: (i) it schedules sections of subjects so that each section is evenly likely to be registered by the students, and (ii) it considers the failure rates and periodicity a subject is taught. We present a multi-objective integer programming model that maximizes the use of specific time slots, the symmetry in which the lectures of a course are scheduled during a week, and the flexibility for straggler students to take courses. The model is solved using commercial software, and it is applied to a real course-timetabling problem. We show the advantages of its use by comparing the model’s solution with the actual solution obtained by the manual scheduling.

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Boyd, Brian, Mary Simpson, and Margaret Gooday. "Developing a Framework for Effective Learning and Teaching in a Secondary School Setting." Scottish Educational Review 34, no. 2 (March 18, 2002): 188–202. http://dx.doi.org/10.1163/27730840-03402007.

Повний текст джерела

Анотація:

This article describes a research study commissioned by a Scottish Council, designed to investigate aspects of educational provision in the first two years of secondary education and with the aim of generating a framework for the development of teaching and learning policies in the Council’s schools. The context for the research included the Council’s best value regime, the advice from HMI to schools on how the quality and outcomes of the educational experiences of pupils in S1 and S2 could be improved, and the concern of the Council at the prospective adoption by schools of practices derived from that advice, which contravened its own guidelines particularly on mixed ability classes. We report our findings in four key areas of educational provision: transition arrangements between primary and secondary school; timetabling and its effects on learning and teaching; coherence and core skills; and class organisation. Finally, we consider the difficulties of conducting objective and impartial research in the politicised and professionally partial arena of educational improvement.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Alghamdi, H., T. Alsubait, H. Alhakami, and A. Baz. "A Review of Optimization Algorithms for University Timetable Scheduling." Engineering, Technology & Applied Science Research 10, no. 6 (December 20, 2020): 6410–17. http://dx.doi.org/10.48084/etasr.3832.

Повний текст джерела

Анотація:

The university course timetabling problem looks for the best schedule, to satisfy given criteria as a set of given resources, which may contain lecturers, groups of students, classrooms, or laboratories. Developing a timetable is a fundamental requirement for the healthy functioning of all educational and administrative parts of an academic institution. However, factors such as the availability of hours, the number of subjects, and the allocation of teachers make the timetable problem very complex. This study intends to review several optimization algorithms that could be applied as possible solutions for the university student course timetable problem. The reviewed algorithms take into account the demands of institutional constraints for course timetable management.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Wu, Liping. "The application of Coarse-Grained Parallel Genetic Algorithm with Hadoop in University Intelligent Course-Timetabling System." International Journal of Emerging Technologies in Learning (iJET) 10, no. 8 (December 14, 2015): 11. http://dx.doi.org/10.3991/ijet.v10i8.5206.

Повний текст джерела

Анотація:

The university course-timetabling problem is a NP-C problem. The traditional method of arranging course is inefficient, causes a high conflict rate of teacher resource or classroom resource, and is poor satisfaction in students. So it does not meet the requirements of modern university educational administration management. However, parallel genetic algorithm (PGA) not only have the advantages of the traditional genetic algorithm(GA), but also take full advantage of the computing power of parallel computing. It can improve the quality and speed of solving effectively, and have a broad application prospect in solving the problem of university course-timetabling problem. In this paper, based on the cloud computing platform of Hadoop, an improved method of fusing coarse-grained parallel genetic algorithm (CGPGA) and Map/Reduce programming model is deeply researched, and which is used to solve the problem of university intelligent courses arrangement. The simulation experiment results show that, compared with the traditional genetic algorithm, the coarse-grained parallel genetic algorithm not only improves the efficiency of the course arrangement and the success rate of the course, but also reduces the conflict rate of the course. At the same time, this research makes full use of the high parallelism of Map/Reduce to improve the efficiency of the algorithm, and also solves the problem of university scheduling problem more effectively.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Mangion, Margaret, and Jasmin Antonia Riebel. "Young Creators: Perceptions of Creativity by Primary School Students in Malta." Journal of Intelligence 11, no. 3 (March 13, 2023): 53. http://dx.doi.org/10.3390/jintelligence11030053.

Повний текст джерела

Анотація:

Policymakers and employers insist that educational institutions prepare workforce-ready candidates fluent in the application of 21st Century Skills such as creativity. So far, only a few studies have explored the self-perceived creativity of students. This paper addresses this gap in literature by providing an understanding of how young students in upper primary feel about themselves as creative beings. Data for the present study was collected through an anonymous online survey that 561 students, aged 9–11 years and residing in Malta (EU), completed. In-depth responses were collected from a subset of the original sample made up of 101 students through an anonymous online form containing a set of questions. Data was analysed using regression analysis for the quantitative component and through thematic analysis for the qualitative part. Results indicate that, overall, students in Year 6 felt less creative than students in Year 5. Furthermore, findings show that the type of school attended impacted the students’ perception of creativity. From a qualitative perspective, findings led to insights into (i) the interpretation of the term creativity and (ii) the impact of the school environment and how timetabling impacted students’ creativity. The findings suggest that the student’s perceived creative personal identity and the concrete manifestations that they engage in are influenced by environmental factors.

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Huda, Nisrina Nafi’atul, I. Gusti Bagus Budi Dharma, and Widya Wasityastuti. "Aplikasi Metode Sequential Three-Stage Integer Goal Programming untuk Penjadwalan Kuliah." Jurnal Pendidikan Kedokteran Indonesia: The Indonesian Journal of Medical Education 5, no. 1 (March 27, 2016): 29. http://dx.doi.org/10.22146/jpki.25309.

Повний текст джерела

Анотація:

Background: One of scheduling problems in educational sector currently was the course scheduling in college or well known as University Course Timetabling Problem (UCTP). The UCTP was comprehensive because of the policy difference among the university, faculties, and departments. The Faculty of Medicine Universitas Gadjah Mada, which organizes a block system has a different and more complex scheduling type than other faculties with non-block system. The porpose of this research was to build a mathematic model of block system UCTP in Faculty of Medicine Universitas Gadjah Mada to optimize the scheduling process time and results.Method: This research was conducted by dividing the scheduling problem into 4 sub – scheduling problems that are sequential, which are the scheduling of the 5 primary courses (lecture, panel discussion, practical sessions, tutorial, and skills laboratory), scheduling topics for each course, student’ group scheduling, and classroom scheduling. The problems are then modeled in the form of integer goal programming. Results: The block system scheduling model in Faculty of Medicine Universitas Gadjah Mada by considering topic and possibility of unavailability room using Sequential Three-Stage Integer Goal Programming has successfully developed and well verified.Conclusion: The model developed in this study is able to produce a schedule that meets all hard constraint in less than 24 hours. The result was more efficient compared to the previous trial-and-error method that consumed 30-45 days.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Dye, R. C. F. "A Computer-Generated ‘Pseudo-Experiment’ in Fluid Mechanics." International Journal of Mechanical Engineering Education 31, no. 2 (April 2003): 143–49. http://dx.doi.org/10.7227/ijmee.31.2.6.

Повний текст джерела

Анотація:

The paper presents experience in setting up and running a computer-based alternative to a traditional undergraduate laboratory class as part of an introductory course in fluid mechanics. The ‘pseudo-experiment’ is not a computer simulation but provides each individual student with a realistic set of experimental readings (including likely random errors) for a real set of apparatus on which they have earlier conducted a real ‘hands-on’ experiment, and which was available for them to inspect or operate in their own time. Students were expected to process the results supplied and then write the usual form of full report on the experiment, including of course a full discussion of the results obtained. The results the students obtained were very close to what would have been obtained by real measurement at the flow rate given, and the inclusion of a realistic level of random error ensured that these results varied slightly from student to student, thus inhibiting copying of work. The arrangement eased timetabling problems and provided a significant saving in academic resource while retaining many of the advantages of a real hands-on laboratory class, and enhanced the students' educational experience compared with earlier arrangements. An additional advantage of the system adopted was that each student's correct calculated output was exactly known so that marking could be undertaken by paid postgraduate assistants rather than academic staff.

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Parnell, Rosie, and Lisa Procter. "Flexibility and placemaking for autonomy in learning." Educational and Child Psychology 28, no. 1 (2011): 77–88. http://dx.doi.org/10.53841/bpsecp.2011.28.1.77.

Повний текст джерела

Анотація:

Flexibility is a key aspiration of contemporary government guidance on school design. Used liberally, the term provides a convenient site for the meeting of educational approach (think flexible, personalised learning, timetabling, groupings) and spatial design (non-bounded, open space, moveable elements, independent structure and services). However, this meeting seems to pose a challenge. As Building Bulletin 95 puts it: ‘…the most flexibly designed spaces can only work if building users have a flexible attitude.’ Framing flexibility in the discourse of autonomy, this paper contends that it can be understood as a ‘tool’ to enable children to experience authorship of their own learning. The paper draws on participatory action research with primary and secondary schools in England in which the built environment and placemaking were explored as a means to support learning. Through examples, it is argued that once children are enabled to experience their learning environment as ‘flexible’, by changing it themselves, they are better able to self-direct their learning. Findings show that flexible learning space is encouraged when children and teachers experience together how their environment can support their learning needs. Once established, it is an environment that is constantly changing according to the needs of individuals and groups. The paper concludes that flexibility, at the congruence of spatial design and learning, can only be attained once children feel trusted to shape their environment within an enabling school culture.

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Speed, Emma, Miles Thomas, and Helena Bunn. "The English Baccalaureate and devaluation of the arts in school: Students’ perceptions of subject value, and the psychological and social impact." Educational and Child Psychology 38, no. 2 (June 2021): 95–113. http://dx.doi.org/10.53841/bpsecp.2021.38.2.95.

Повний текст джерела

Анотація:

Aim:The article explores secondary school students’ perceptions of the ‘value’ of UK curriculum subjects; alongside what, how and why specific subject value attribution patterns are important for students, and the psychological impact of this on their wellbeing and academic self-efficacy beliefs (SEB).Method/Rationale:A mixed-methods, sequential design was used. Stage 1 explored students’ value attribution for specific subjects; and relationships between attribution patterns, SEB and wellbeing. Stage 2 further explored and explained Stage 1 findings. In Stage 1, attainment data and questionnaires were collected from 38 Year 9 students. Thematic analysis explored students’ value attribution for subjects, while Mann-Whitney and t-tests explored the relationships between attribution patterns, SEB and wellbeing. In Stage 2, nine participants were interviewed, and relationships identified were thematically analysed.Findings:Three superordinate themes (perceived usefulness, external factors and lessons’ characteristics) justified the subject attributed value, highly biased towards English Baccalaureate (EBacc) subjects. Students with strengths in non-EBacc subjects had significantly lower SEB than students with strengths in EBacc subjects; similar results were found for students with strengths in subjects they had not identified as ‘important’ versus students with strengths in subjects they had identified as ‘important’. Wellbeing measures did not yield statistical differences. Stage 2 findings suggested students with strengths in EBacc subjects felt cleverer, as their skills were respected by peers and appreciated by teachers; EBacc subjects were perceived as more ‘academic’ than non-EBacc subjects. The timetabling and the EBacc’s academic value were identified as adverse factors for non-EBacc subjects, alongside fewer opportunities to progress in and receive positive feedback for skills in non-EBacc subjects.Conclusions:As previous literature indicates SEB relate to education and employment opportunities, the research suggests potential future educational and social inequalities for students with strengths in non-EBacc subjects, problematic for social justice.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Ngo, Son Tung, Jafreezal B. Jaafar, Izzatdin Abdul Aziz, Giang Hoang Nguyen, and Anh Ngoc Bui. "Genetic Algorithm for Solving Multi-Objective Optimization in Examination Timetabling Problem." International Journal of Emerging Technologies in Learning (iJET) 16, no. 11 (June 4, 2021): 4. http://dx.doi.org/10.3991/ijet.v16i11.21017.

Повний текст джерела

Анотація:

Examination timetabling is one of 3 critical timetabling jobs besides enrollment timetabling and teaching assignment. After a semester, scheduling examinations is not always an easy job in education management, especially for many data. The timetabling problem is an optimization and Np-hard problem. In this study, we build a multi-objective optimizer to create exam schedules for more than 2500 students. Our model aims to optimize the material costs while ensuring the dignity of the exam and students' convenience while considering the rooms' design, the time requirement of each exam, which involves rules and policy constraints. We propose a programmatic compromise to approach the maximum tar-get optimization model and solve it using the Genetic Algorithm. The results show the effectiveness of the introduced algorithm.

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Mackenzie, Lee. "Evaluation of an English language peer tutoring intervention." International Journal of Educational Management 34, no. 5 (December 23, 2019): 869–80. http://dx.doi.org/10.1108/ijem-04-2019-0129.

Повний текст джерела

Анотація:

PurposeDesertion rates in Colombian universities remain unacceptably high. In the field of foreign languages, academic failure is particularly concerning since English language instruction is compulsory in most universities. To address the issue of poor student performance and high dropout rates, the University of Colombia has set up a peer tutoring scheme (PTS) for English as a foreign language (EFL) students in order to inform programme development. The paper aims to discuss this issue.Design/methodology/approachThe study was informed by realist evaluation principles. Qualitative in-depth interviews were conducted with eight PTS stakeholders supplemented by documentary analysis of the programme’s publicity material on the PTS website. The data were analysed using thematic analysis.FindingsFindings reveal discrepancies between the “espoused theory” about how the programme operates and the “theory-in-use”. In particular, according to stakeholders, the programme does not appear to be used by many of those EFL students who would benefit from it, which suggests that the programme is not as effective as it could be. Student and teacher contextual factors and mechanisms may explain the reasons for issues with programme effectiveness.Research limitations/implicationsFormative evaluations such as the current study can provide rich contextual information, but cannot be generalised to other settings. Also, this study does not explore the perspective of peer tutors and tutees, which means key variables may have been overlooked. Further research into the perspectives of tutors and tutees would therefore be needed to firm up these conclusions.Practical implicationsDue to the scarcity of literature into EFL peer tutoring interventions in higher education (HE), it is hoped that these findings will have relevance for similar contexts. The current evaluation highlights the influence of contextual factors such as willingness to ask for help, student motivation, student priorities, tutor credibility, teacher workload, timetabling and scheduling issues and involvement from teachers on the success of open-access peer tutoring programmes for EFL students in higher educational settings.Originality/valueAs far the researcher is aware, this is the first evaluation of an EFL peer tutoring programme in a private HE context in Colombia, and one of only a handful of studies into EFL peer tutoring programmes. The findings therefore have implications for those working in similar contexts.

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Esquivel Trujillo, Linda Lucia, and Juan Pablo Orejuela C. "Programación de horario escolar con multi-localización y preferencias docentes. [School course timetable with multi location and preferences of teachers]." Revista Logos Ciencia & Tecnología 11, no. 1 (January 1, 2019): 20–29. http://dx.doi.org/10.22335/rlct.v11i1.621.

Повний текст джерела

Анотація:

Esta investigación aborda el problema de programación del horario escolar en Instituciones Educativas, con dos jornadas y con múltiples sedes, que exigen el desplazamiento de algunos maestros entre estas. El problema se resuelve mediante un modelo de programación lineal entera que minimiza el traslado de docentes entre sedes. La metodología planteada consideró dos tipos de restricciones: las obligatorias, pertenecientes al marco legal e institucional, y los requerimientos del cuerpo docente, que no son de estricto cumplimiento. El modelo se validó y se desarrollaron experimentos computacionales en varias instancias usando Lingo ® 14. Adicionalmente, para conocer su comportamiento, se realizó un análisis de estructura en dos escenarios. En todas las instancias se obtuvo un mínimo de desplazamientos de los docentes.Palabras clave: Gestión de horarios, Programación de horarios de clase para colegios, Preferencias de Horario de los docentes, Programación lineal entera. AbstractIn this research is arises the problem of building the school timetable an Educational Institution (EI’s) with multiple headquarters that provide classes in morning and afternoon, forcing than during the school day some teachers must move between headquarters. The problem is tackled by using an integer lineal programming model (ILP) as tool solution. According to the above, the model has, as one of its objectives minimize transfers of teachers between different headquarters. The proposed methodology considers two types of constraints, mandatory (hard) belonging to the legal and institutional framework concerning the Institutional Education Project (IEP), and faculty requirements (soft) that are not strict obedience. The proposed model was validated in a case study, and computational experiments were developed in several instances using Lingo ® 14. Additionally, to know its behavior, a structure analysis was performed in two scenarios. In all instances, a minimum of teacher displacement was obtained.Keywords: Management of schedules, School Course Timetabling, Teacher Schedule Preferences, Integer Linear Programming.ResumoEsta pesquisa aborda o problema da programação de horários escolares em Instituições Educacionais, com dois dias e múltiplos locais, que exigem o deslocamento de alguns professores entre eles. O problema é resolvido por todo um modelo de programação linear que minimiza a transferência de professores entre os locais. A metodologia proposta considerou dois tipos de restrições: obrigatória, pertencente ao arcabouço legal e institucional, e os requisitos do corpo docente, que não são rigorosamente cumpridos. O modelo foi validado e experimentos computacionais foram desenvolvidos em várias instâncias utilizando o Lingo 14. Além disso, para conhecer seu comportamento, foi realizada uma análise estrutural em dois cenários. Em todos os casos, foi obtido um mínimo de deslocamento do professor.Palavras-chave: Gestão de horários, programação de horários de aulas para escolas, agendamento de preferências de professores, programação linear inteira.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Bolam, Helen, and Richard Dodgson. "Retaining and Supporting Mature Students in Higher Education." Journal of Adult and Continuing Education 8, no. 2 (May 2003): 179–94. http://dx.doi.org/10.7227/jace.8.2.5.

Повний текст джерела

Анотація:

An increasing proportion of the United Kingdom's (UK) full-time undergraduate student population is mature. However, the reasons as to why these students leave higher education early are under-researched. Based upon research conducted in the North East of England, this article contributes to the closure of this gap as it highlights a number of issues that impact upon the retention of mature students. These issues include finance, a lack of preparedness for higher education and timetabling. The North East's six universities have responded to these issues by introducing systems of support that span the student lifecycle.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Kahar, M. N. M., Sarina Abu Bakar, L. C. Shing, and Ashis Kumar Mandal. "Solving Kolej Poly-Tech Mara Examination Timetabling Problem." Advanced Science Letters 24, no. 10 (October 1, 2018): 7577–81. http://dx.doi.org/10.1166/asl.2018.12981.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Moore, U., J. Durham, I. Corbett, and P. Thomson. "The influence of staffing and timetabling on achieving competence in surgical extractions." European Journal of Dental Education 13, no. 1 (February 2009): 15–19. http://dx.doi.org/10.1111/j.1600-0579.2008.00531.x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Hart, Sarah M., Mary F. Hill, and Janet S. Gaffney. "Timetabling a transition with dignity: Perspectives of young adults with significant support needs." Journal of Intellectual & Developmental Disability 46, no. 3 (March 28, 2021): 227–38. http://dx.doi.org/10.3109/13668250.2021.1885973.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Obit, Joe Henry, Rayner Alfred, and Mansour Hassani Abdalla. "A PSO Inspired Asynchronous Cooperative Distributed Hyper-Heuristic for Course Timetabling Problems." Advanced Science Letters 23, no. 11 (November 1, 2017): 11016–22. http://dx.doi.org/10.1166/asl.2017.10210.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Dahnoun, Naim. "Teaching electronics to first-year non-electrical engineering students." International Journal of Electrical Engineering & Education 54, no. 2 (February 7, 2017): 178–86. http://dx.doi.org/10.1177/0020720917692345.

Повний текст джерела

Анотація:

Teaching electronics is not only for electrical and electronics students but also for mechanical, aerospace, engineering design, civil and engineering mathematics programmes, which are likely to have electronics units as part of their curriculum. To teach electronics for these non-electronic programmes is very challenging in many aspects. First, the electronics unit has to satisfy the learning outcomes for each programme. Second, the student’s motivation is normally very low since electronics is not the career the students would like to pursue. Third, the timetabling can be an issue when a large number of students are enrolled; for instance, at the University of Bristol, over 340 students are registered for the electronics unit. Due to this large number and the capacity of the electrical laboratory, students will have laboratory experiments timetabled in different weeks and some may have laboratory experiments before the lectures are covered. Finally, a method of assessing this large number of students has to be put into place. In this paper, the content of the unit including the laboratory experiments, the methods of course delivery and the assessment methods are justified. Also, since students learn differently and have a variety of motivations, a combination of teaching methods has to be found to satisfy more students and improve the learning outcomes.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Obit, Joe Henry, Kuan Yik Junn, and Rayner Alfred. "Performance Comparison of Linear and Non-Linear Great Deluge Algorithms in Solving University Course Timetabling Problems." Advanced Science Letters 23, no. 11 (November 1, 2017): 11027–30. http://dx.doi.org/10.1166/asl.2017.10212.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Raza, Syed Arshad. "Managing ethical requirements elicitation of complex socio-technical systems with critical systems thinking: A case of course-timetabling project." Technology in Society 66 (August 2021): 101626. http://dx.doi.org/10.1016/j.techsoc.2021.101626.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Ceschia, Sara, Luca Di Gaspero, and Andrea Schaerf. "Educational Timetabling: Problems, Benchmarks, and State-of-the-Art Results." European Journal of Operational Research, July 2022. http://dx.doi.org/10.1016/j.ejor.2022.07.011.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Way Shen, Lam, Hishammuddin Asmuni, and Fong Cheng Weng. "A Modified Migrating Bird Optimization For University Course Timetabling Problem." Jurnal Teknologi 72, no. 1 (December 29, 2014). http://dx.doi.org/10.11113/jt.v72.2949.

Повний текст джерела

Анотація:

University course timetabling problem is a dilemma which educational institutions are facing due to various demands to be achieved in limited resources. Migrating bird optimization (MBO) algorithm is a new meta-heuristic algorithm which is inspired by flying formation of migrating birds. It has been applied successfully in tackling quadratic assignment problem and credit cards fraud detection problem. However, it was reported that MBO will get stuck in local optima easily. Therefore, a modified migrating bird optimization algorithm is proposed to solve post enrolment-based course timetabling. An improved neighbourhood sharing mechanism is used with the aim of escaping from local optima. Besides that, iterated local search is selected to be hybridized with the migrating bird optimization in order to further enhance its exploitation ability. The proposed method was tested using Socha’s benchmark datasets. The experimental results show that the proposed method outperformed the basic MBO and it is capable of producing comparable results as compared with existing methods that have been presented in literature. Indeed, the proposed method is capable of addressing university course timetabling problem and promising results were obtained.

Стилі APA, Harvard, Vancouver, ISO та ін.

Статті в журналах з теми "Educational Timetabling"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями