نتایج جستجو برای: timetabling

تعداد نتایج: 1241  

Journal: :Int. J. Intell. Syst. 1997
Amnon Meisels Ehud Gudes Gadi Solotorevsky

Employee Timetabling Problems (ETP) are all around us. One possible approach for solving ETPs is to use constraint processing techniques. Another approach is to model human knowledge which is commonly used for solving such problems into knowledge-based systems for timetabling. It is diicult to represent the complex constraints of timetabling explicitly in constraint networks. On the other hand,...

1998
M Yoshikawa K Kaneko Y Nomura M Watanabe H W Chan C K Lau

[7] G. Lajos. Complete university modular timetabling using constraint logic programming. A constraint-based approach to high-school timetabling problems: A case study. 14 problem diculty is observed. 6 Conclusions We have proposed a constraint satisfaction model for a local high school timetabling problem. The problem we have studied involves an assignment of eight weekly periods to the sectio...

2006
Radomír Perzina

The timetabling problem is well known to be NP complete combinatorial problem. The problem becomes even more complex when addressed to individual timetables of students. The core of dealing with the problem in this application is a timetable builder based on mixed direct-indirect encoding evolved by a genetic algorithm with a self-adaptation paradigm, where the parameters of the genetic algorit...

2008
Tiago Cardal Pais P. Amaral

In this paper we present an application of Tabu Search (TS) to the exams timetabling problem. One of the drawback of this meta-heuristic is related with some parameter that can affect the performance of the algorithm and must be tuned. One of such is tabu tenure which is much problem dependent. Our goal is to have a automatic process of managing the memory which is important for practical appli...

2008
Edmund K. Burke Barry McCollum Paul McMullan Andrew J. Parkes

We investigate multi-objective aspects of the new examination timetabling model introduced as part of the 2007 International Timetabling Competition. We propose one way to group together the objectives to represent the separate interests of the students and administration, and produce an example of an associated (Pareto) trade-off curve.

2016
Ewout Gort

Higher education institutions (HEIs) are under constant competitive pressure [10] which results in an increased importance of efficiency and effectiveness in the organisation, which in turn increases the importance of selecting the right timetabling application. Timetabling applications are increasingly considered to be at the heart of the HE organisation. They have impact on the schedules of t...

2014
Dulce J. Magaña-Lozano Ender Özcan Santiago E. Conant-Pablos

Timetabling is a crucial and often extremely time consuming task in many educational institutions. This task is generally performed periodically (each year, semester, quarter) for fulfilling the requirements imposed by the institution and people involved, such as students and teachers/lecturers making efficient and effective use of the available resources. The educational timetabling problem ha...

2013
Ignacio Castiñeiras Fernando Sáenz-Pérez

This technical report focuses on a concrete instance of the real-life employee timetabling problem presented in the paper “Applying CP(FD), CLP(FD) and CFLP(FD) to a Real-Life Employee Timetabling Problem”. It provides additional material that would help the reader of the paper in both understanding the algorithm proposed as well as the code of the models provided online.

2006
Christian Artigues Michel Gendreau Louis-Martin Rousseau

We propose a flexible model and several integer linear programming and constraint programming formulations for integrated employee timetabling and production scheduling problems. A hybrid constraint and linear programming exact method is designed to solve a basic integrated employee timetabling and job-shop scheduling problem for lexicographic minimization of makespan and labor costs. Prelimina...

2006
Salwani Abdullah Edmund K. Burke

This paper investigates a hybridisation of the very large neighbourhood search approach with local search methods to address examination timetabling problems. In this paper, we describe a 2 phase approach. The first phase employs “multi start” to carry out search upon a very large neighbourhood of solutions using graph theoretical algorithms implemented on an improvement graph. The second phase...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید