Filters








1,857 Hits in 5.2 sec

A comparison of annealing techniques for academic course scheduling [chapter]

M. A. Saleh Elmohamed, Paul Coddington, Geoffrey Fox
1998 Lecture Notes in Computer Science  
We have investigated a variety of approaches based on simulated annealing, including mean-field annealing, simulated annealing with three different cooling schedules, and the use of a rule-based preprocessor  ...  In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level.  ...  Many thanks go to Karen Bedard for providing us with the data and answering so many questions we had about it, Meg Cortese for providing us with a set of building constraints for various departments, and  ... 
doi:10.1007/bfb0055883 fatcat:nooie453ojfhrarpeyjprywcfe

Solving the Course Scheduling Problem Using Simulated Annealing

E. Aycan, T. Ayav
2009 2009 IEEE International Advance Computing Conference  
The aim is to find a feasible timetable for the department of computer engineering inİzmir Institute of Technology. The approach focuses on simulated annealing.  ...  This paper tackles the NP-complete problem of academic class scheduling (or timetabling).  ...  CONCLUSION This paper presents simulated annealing mechanism for the course scheduling problem of the university's computer engineering department.  ... 
doi:10.1109/iadcc.2009.4809055 fatcat:dd77t6mvpneynibxgl6r5hxeha

Comparison Performance of Genetic Algorithm and Ant Colony Optimization in Course Scheduling Optimizing

Imam Ahmad Ashari, Much Aziz Muslim, Alamsyah Alamsyah
2016 Scientific Journal of Informatics  
To resolve a scheduling problem most appropriate technique used is the technique of optimization. Optimization techniques can give the best results desired.  ...  In this paper, we use a genetic algorithm and ant colony optimization algorithm is an algorithm metaheuristic to solve the problem of course scheduling.  ...  The data set will be used to compare the two algorithms is a schedule of courses in the Department of Computer Science in odd semester of the 2015/2016 academic year.  ... 
doi:10.15294/sji.v3i2.7911 fatcat:jitkbj54nvglfl4drclxvxnhzy

Hybrid Simulated Annealing with Meta-Heuristic Methods to Solve UCT Problem

Issam AlHadid, Khalid Kaabneh, Hassan Tarawneh
2018 Modern Applied Science  
Simulated Annealing (SA) is a common meta-heuristic algorithm that has been widely used to solve complex optimization problems.  ...  In addition, the results showed that our proposed technique has outperformed the standard SA and gave comparable results to other approaches in the literature when tested on ITC2007-Track3 university course  ...  Building the academic timetable is a typical real world-scheduling problem and became a very challenging work in every academic institution each year.  ... 
doi:10.5539/mas.v12n11p385 fatcat:fw442uyssfdjhpkrjufjyepgni

A Developed Uncapacitated Scheduling Algorithm of Building Timetables for Different Exam Kinds

Hussein Al Bazar, Hussein Abdel-Jaber
2020 Journal of Computer Science  
This paper proposes a scheduling algorithm for tackling such an issue.  ...  Scheduling many exams into different timeslots and rooms while meeting all given requirements is a difficult task, which requires designing and proposing a scheduling algorithm to deal with the issue of  ...  Acknowledgement The authors of this manuscript would like to express their appreciations and gratitude to the Arab Open University in the Kingdom of Saudi Arabia for supporting this research.  ... 
doi:10.3844/jcssp.2020.1139.1149 fatcat:xg52vk2hp5cw5mrslzz3ubi5hu

Page 160 of The Journal of the Operational Research Society Vol. 57, Issue 2 [page]

2006 The Journal of the Operational Research Society  
A comparison of annealing techniques for academic course scheduling. In: Burke E and Carter M (eds).  ...  Handhook of Graph Theory, Chapman & Hall/CRC Press, London, Boca Raton, FL, pp 445-474 Schaerf A (1996). Tabu search techniques for large high-school timetabling problems.  ... 

Using Random Scheduling Technique with Crowd-Sourcing to Solve Exam Timetable

Charles Roland Haruna, Elliot Attipoe, Isaac Armah Mensah, Kwame Opuni-Boachie Obour Agyekum
2022 International Journal of Computer Applications  
In this paper, a case study is presented and a hybrid technique tailored to suit the University of Cape Coast examination timetable scheduling is proposed, where machines are first used then experts complete  ...  Thus, scheduling of an examination timetable is a large and complex assignment.  ...  We appreciate the confidence reposed in us to write this scientific paper for the body of knowledge and particularly for the University of Cape Coast. Our gratitude is boundless.  ... 
doi:10.5120/ijca2022921928 fatcat:4orsiffvrndslcdgifuagb5c34

A Review of Optimization Algorithms for University Timetable Scheduling

H. Alghamdi, T. Alsubait, H. Alhakami, A. Baz
2020 Engineering, Technology & Applied Science Research  
Developing a timetable is a fundamental requirement for the healthy functioning of all educational and administrative parts of an academic institution.  ...  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  ...  Thus, it is important to apply optimization algorithms for effective scheduling of the course timetable. The use of optimization techniques in problemsolving dates back several decades.  ... 
doi:10.48084/etasr.3832 fatcat:3hpxnlwq35ctzahn755fpshkpu

A Survey of University Course Timetabling Problem: Perspectives, Trends and Opportunities

Mei Ching Chen, San Nah Sze, Say Leng Goh, Nasser R. Sabar, Graham Kendall
2021 IEEE Access  
It is a very hard combinatorial optimisation problem which attracts the interest of many researchers.  ...  The timetabling problem is common to academic institutions such as schools, colleges or universities.  ...  This paper would not have been published without the support of UNIMAS.  ... 
doi:10.1109/access.2021.3100613 fatcat:ahnq6zduajdulfcybaclkgg3ze

Automated University Timetabling: The State of the Art

E. Burke
1997 Computer journal  
Scheduling lectures or exams for universities is a large and complex task.  ...  Given its complexity, there is great potential for computational techniques to help ease the task of university timetabling.  ...  Acknowledgements The authors would like to thank Dave Corne, Alain Hertz, Johnathan Thompson and George White for helpful comments on the paper.  ... 
doi:10.1093/comjnl/40.9.565 fatcat:2sbv5lw3zbdxxi2xzrarufs5fe

An Assignment Problem and Its Application in Education Domain: A Review and Potential Path

Syakinah Faudzi, Syariza Abdul-Rahman, Rosshairy Abd Rahman
2018 Advances in Operations Research  
This paper presents a review pertaining to assignment problem within the education domain, besides looking into the applications of the present research trend, developments, and publications.  ...  As such, this review summarizes and records a comprehensive survey regarding assignment problem within education domain, which enhances one's understanding concerning the varied types of assignment problems  ...  to produce this piece of work.  ... 
doi:10.1155/2018/8958393 fatcat:jxud33iht5hm5f4uu4lljqigjm

An application of Soft System Methodology

M. Reza Mehregan, Mahnaz Hosseinzadeh, Aliyeh Kazemi
2012 Procedia - Social and Behavioral Sciences  
This paper also provides an appropriate course timetable for the management faculty at University of Tehran to show the potential of this application to real problems.  ...  Hence, it involves a large number of stakeholders including students, teachers and institutional administrators.  ...  for next terms according student's desires. 5-Fixing the culture of being full time at university for lectures and students. 6-Having a fixed approach in assigning common courses to a specific academic  ... 
doi:10.1016/j.sbspro.2012.04.051 fatcat:765zi6ygyjbprnnz5qbehodff4

Memory Length in Hyper-heuristics: An Empirical Study

Ruibin Bai, Edmund K. Burke, Michel Gendreau, Graham Kendall, Barry McCollum
2007 2007 IEEE Symposium on Computational Intelligence in Scheduling  
We focus on a recently proposed simulated annealing hyper-heuristic and choose a set of hard university course timetabling problems as the test bed for this empirical study.  ...  The experimental results show that the memory length can affect the performance of hyper-heuristics and a good choice of memory length is able to improve solution quality.  ...  This model provides a representation of a typical university course timetabling problem and has been used in many academic publications.  ... 
doi:10.1109/scis.2007.367686 dblp:conf/cisched/BaiBGKM07 fatcat:v3aggssvdvhkzpu5oyi63jv324

Page 2681 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
Smith, A comparison of heuristics for telecommunications traf- fic routing (235-254); A. J.  ...  Dowsland, Simulated annealing solutions for multi-objective scheduling and timetabling (155-166); Joanna Jézefowska, Grzegorz Waligéra and Jan Weglarz, A tabu search algorithm for some discrete-continuous  ... 

Improving FPGA Placement With Dynamically Adaptive Stochastic Tunneling

Mingjie Lin, John Wawrzynek
2010 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
A prototype annealing-based placer, called DAST, was developed as part of this paper.  ...  This paper develops a dynamically adaptive stochastic tunneling (DAST) algorithm to avoid the "freezing" problem commonly found when using simulated annealing for circuit placement on field-programmable  ...  Burke for the help with software implementation.  ... 
doi:10.1109/tcad.2010.2061670 fatcat:ompjb3hi4bfcxodasa4z2akwta
« Previous Showing results 1 — 15 out of 1,857 results