Time-Tabling Problems: Should They Be Canonical?

Werra, Dominique de; Pasche, C.; Petter, Andreas

doi:10.1080/03155986.1986.11732014

Cited by 2 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Equation ( 16) presents the Kruskal-Wallis test. If there are observations with equal values, then Equation ( 16) is divided by the relation (17), where H is the value of the contrast statistic, C is the number of the algorithms to analyze (in this case there are six algorithms), n i is the number of observations in the ith algorithm (number of results of each algorithm), N = ∑n i is the total number of results of all algorithms and R i is the sum of the ranges in the ith algorithm.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Metaheuristic with Cooperative Processes for the University Course Timetabling Problem

et al. 2022

View full text Add to dashboard Cite

This work presents a metaheuristic with distributed processing that finds solutions for an optimization model of the university course timetabling problem, where collective communication and point-to-point communication are applied, which are used to generate cooperation between processes. The metaheuristic performs the optimization process with simulated annealing within each solution that each process works. The highlight of this work is presented in the algorithmic design for optimizing the problem by applying cooperative processes. In each iteration of the proposed heuristics, collective communication allows the master process to identify the process with the best solution and point-to-point communication allows the best solution to be sent to the master process so that it can be distributed to all the processes in progress in order to direct the search toward a space of solutions which is close to the best solution found at the time. This search is performed by applying simulated annealing. On the other hand, the mathematical representation of an optimization model present in the literature of the university course timing problem is performed. The results obtained in this work show that the proposed metaheuristics improves the results of other metaheuristics for all test instances. Statistical analysis shows that the proposed metaheuristic presents a different behavior from the other metaheuristics with which it is compared.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Subsequently, at the beginning of the 1970s, more generic techniques began to be applied to solve the problem. Some of the best-known research includes algorithms based on integer programming [15] and network flow [16][17][18], among others.…”

mentioning

confidence: 99%

Metaheuristic with Cooperative Processes for the University Course Timetabling Problem

et al. 2022

View full text Add to dashboard Cite

show abstract

Allocating conference delegates to workshops: A special timetabling problem

Sinclair¹,

Esterhuyzen²

2003

ORiON

View full text Add to dashboard Cite

The problem of assigning delegates to workshops at a conference can be formulated as a timetabling problem. Such an assignment must take into account the preferences of the delegates, as well as the number of participants each workshop can accommodate. This paper will report on a heuristic solution technique for a special case of such a problem . An implementation of the method for the solution of a real world problem will also be reported.

show abstract

Time-Tabling Problems: Should They Be Canonical?

Cited by 2 publications

References 4 publications

Metaheuristic with Cooperative Processes for the University Course Timetabling Problem

Metaheuristic with Cooperative Processes for the University Course Timetabling Problem

Allocating conference delegates to workshops: A special timetabling problem

Contact Info

Product

Resources

About