A practical three‐phase ILP approach for solving the examination timetabling problem

Al‐Hawari, Feras; Al-Ashi, Mahmoud; Abawi, Fares; Alouneh, Sahel

doi:10.1111/itor.12471

Cited by 11 publications

(6 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For the construction phase, we could avoid building the initial solution from scratch by using long-term memory, through data mining or path-relinking [28]. For improving the solution quality, we intend to study the incorporation of a MIP model to the R-GRASP for solving related subproblems of the PCCTP, since it has been proved to be a interesting approach [1,2,8].…”

Section: Discussionmentioning

confidence: 99%

Reactive GRASP for the Prize-collecting Covering Tour Problem

Clímaco

Rosseti

Silva³

et al. 2021

RAIRO-Oper. Res.

View full text Add to dashboard Cite

This paper presents a greedy randomized adaptive search procedure (GRASP) for the prize-collecting covering tour problem, which is the problem of finding a route for traveling teams that provide services to communities geographically distant from large urban locations. We devised a novel hybrid heuristic by combining a reactive extension of the GRASP with Random Variable Neighborhood Search (VND) meta-heuristic for the purpose of solving the PCCTP. Computational experiments were conducted on a PCCTP benchmark from the literature, and the results demonstrate our approach provides a significant improvement in solving PCCTP and comparable with the state-of-the-art, mainly regarding the computational processing time.

show abstract

Section: Discussionmentioning

confidence: 99%

Reactive GRASP for the Prize-collecting Covering Tour Problem

Clímaco

Rosseti

Silva³

et al. 2021

RAIRO-Oper. Res.

View full text Add to dashboard Cite

show abstract

“…Al-Hawari ve diğ. [22] çalışmalarında, üniversitenin sınav programını 3 aşamalı olarak ele almışlardır. İlk aşamada sınavın hangi zaman dilimine atanacağına, ikinci aşamada atanacağı güne, üçüncü aşamada atanacağı dersliğe karar verilmiştir.…”

Section: Literatür Taramasıunclassified

A course scheduling model based on academic title-based preferences and deviations- a case study of industrial engineering department

TÜKENMEZ¹,

Şahin²

2022

Pamukkale J Eng Sci

View full text Add to dashboard Cite

Ders programı çizelgeleme problemi, üniversiteler ve benzeri eğitim kurumlarında yaygın olarak karşılaşılan zaman çizelgeleme problemlerinden birisidir. Çözümü, yoğun iş gücü ve kaynak gerektirmekte olup birçok eğitim kurumunda çizelgeleme problemi halen elle yapılmakta ve çok zaman kaybettirmektedir. Ders programı çizelgeleme problemi, eğitim kurumlarına özgü kısıt yapıları dikkate alınarak, derslerin uygun zaman dilimlerine atanmasını konu almaktadır. Kısıt yapıları, eğitim kurumunun özel kuralları, kapasite kısıtlamaları, yasal düzenlemeler, öğretim elemanları ve öğrencilerin tercihleri gibi farklı faktörlere bağlı olabilir. Bu çalışmada, öğretim elamanı tercihleri doğrultusunda iki yeni 0-1 tam sayılı programlama modeli önerilmiş, bir devlet üniversitesinde yapılan uygulama ile modeller test edilmiştir. Önerilen ilk modelde, öğretim elemanlarının memnuniyetleri en büyüklenmek istenirken, istenmeyen ders çakışması da en küçüklenmek istenmektedir. İkinci modelde ise, ilk model amaçlarına ilave olarak aynı unvana sahip öğretim elemanlarının memnuniyet değerleri arasındaki farkın da en küçüklenmesi amaçlanmıştır. Önerilen modeller, GAMS 23.8.2 yazılımı ile çözülmüş, karar vericiler için uygun olabilecek seçenekler sunulmuştur. Course timetabling problem is one of the most common time scheduling problems that frequently encountered in universities and whole education institutions. To eliminate this problem requires notable amount of labour and supply and in several education institutions, this scheduling is done manually but it doesn't occur as desired and causes to loss of time. Course timetabling problem is the assignment of courses to appropriate time periods, considering the constraint structures specific to the educational institutions. Constraints may depend on different factors such as the specific rules of the educational institution, capacity constraints, legal regulations, faculty and students'preferences. In this study, two new 0-1 integer programming models were proposed by considering preferences of the faculty members, and the models were tested with the application in a state university. In first proposed model, while the total gladness value is desired to be maximized by considering the time-slot preferences of lecturers, the conflict of courses is tried to be minimized. In the second proposed model, the differences in gladness value between lecturers are aimed to be minimized in addition to first model objectives. The proposed models were solved with GAMS 23.8.2 software, and alternatives that could be suitable for decision makers were presented.

show abstract

“…Accordingly, the EMS uses a simple scheduling algorithm that distributes the students one by one over the available seats in the different sessions. In case that policy changes in the future, the EMS can utilize the three‐phase Integer Linear Programming (ILP) method for solving the timetabling problem that is already accessible from the SIS to schedule the exams sessions such that no student can have more than one exam simultaneously.…”

Section: Automation Algorithmsmentioning

confidence: 99%

Integrated and secure web‐based examination management system

Al‐Hawari

Alshawabkeh

Althawbih

et al. 2019

Comp Applic In Engineering

Self Cite

View full text Add to dashboard Cite

A web‐based examination management system that is implemented in‐house is discussed in this paper. It is designed based on the Java enterprise edition three‐tier architecture. It also allows defining and setting up exams according to a flexible tree‐based exams structure. Moreover, it integrates a rich text editor for composing exams suitable for different engineering and language disciplines. In addition, it automates the scheduling, grading, and reporting processes to relieve instructors from such cumbersome tasks. Furthermore, its capabilities and integration with different databases enable it to offer several security schemes that support strong multifactor authentication and authorization, detect impersonation, and prevent cheating. Besides, it provides an easy to use and informative wizard that enables students to take exams. Not to mention, the deployment results illustrate that the system has been successfully used to organize online exams in several semesters over the past 3 academic years. Finally, the conducted user surveys responses assert that the system is also user‐friendly, cutting edge, capable, reliable, fast, and highly available.

show abstract

A practical three‐phase ILP approach for solving the examination timetabling problem

Cited by 11 publications

References 31 publications

Reactive GRASP for the Prize-collecting Covering Tour Problem

Reactive GRASP for the Prize-collecting Covering Tour Problem

A course scheduling model based on academic title-based preferences and deviations- a case study of industrial engineering department

Integrated and secure web‐based examination management system

Contact Info

Product

Resources

About