Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A survey of approaches for university course timetabling problem
H Babaei, J Karimpour, A Hadidi - Computers & Industrial Engineering, 2015 - Elsevier
Scheduling is one of the problems which so many researches have been conducted on it
over the years. The university course timetabling problem which is an NP-hard problem is a …
over the years. The university course timetabling problem which is an NP-hard problem is a …
[PDF][PDF] Optimization Techniques in University Timetabling Problem: Constraints, Methodologies, Benchmarks, and Open Issues.
A Bashab, AO Ibrahim, IA Tarigo Hashem… - … , Materials & Continua, 2023 - eprints.utm.my
University timetabling problems are a yearly challenging task and are faced repeatedly each
semester. The problems are considered nonpolynomial time (NP) and combinatorial …
semester. The problems are considered nonpolynomial time (NP) and combinatorial …
An iterated local search algorithm for the University Course Timetabling Problem
T Song, S Liu, X Tang, X Peng, M Chen - Applied Soft Computing, 2018 - Elsevier
In this paper, an iterated local search algorithm is proposed to find the feasible solution for
the University Course Timetabling Problem. Three key phases are involved in the proposed …
the University Course Timetabling Problem. Three key phases are involved in the proposed …
A harmony search algorithm for university course timetabling
MA Al-Betar, AT Khader - Annals of Operations Research, 2012 - Springer
One of the main challenges for university administration is building a timetable for course
sessions. This is not just about building a timetable that works, but building one that is as …
sessions. This is not just about building a timetable that works, but building one that is as …
Genetic algorithms with guided and local search strategies for university course timetabling
S Yang, SN Jat - IEEE Transactions on Systems, Man, and …, 2010 - ieeexplore.ieee.org
The university course timetabling problem (UCTP) is a combinatorial optimization problem,
in which a set of events has to be scheduled into time slots and located into suitable rooms …
in which a set of events has to be scheduled into time slots and located into suitable rooms …
University course timetabling using a hybrid harmony search metaheuristic algorithm
MA Al-Betar, AT Khader… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
University course timetabling problem (UCTP) is considered to be a hard combinatorial
optimization problem to assign a set of events to a set of rooms and timeslots. Although …
optimization problem to assign a set of events to a set of rooms and timeslots. Although …
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem
S Ceschia, L Di Gaspero, A Schaerf - Computers & Operations Research, 2012 - Elsevier
The post-enrolment course timetabling (PE-CTT) is one of the most studied timetabling
problems, for which many instances and results are available. In this work we design a …
problems, for which many instances and results are available. In this work we design a …
An effective hybrid local search approach for the post enrolment course timetabling problem
We address the post enrolment course timetabling (PE-CTT) problem in this paper. PE-CTT
is known as an NP-hard problem that focuses on finding an efficient allocation of courses …
is known as an NP-hard problem that focuses on finding an efficient allocation of courses …
[PDF][PDF] Fuzzy genetic heuristic for university course timetable problem
A Chaudhuri, K De - Int. J. Advance. Soft Comput. Appl, 2010 - researchgate.net
Abstract University Course Timetable Problem is NP-Hard combinatorial optimization
problem which lacks analytical solution methods. It has received tremendous attention from …
problem which lacks analytical solution methods. It has received tremendous attention from …
A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling
SN Jat, S Yang - Journal of Scheduling, 2011 - Springer
The post enrolment course timetabling problem (PECTP) is one type of university course
timetabling problems, in which a set of events has to be scheduled in time slots and located …
timetabling problems, in which a set of events has to be scheduled in time slots and located …