Large-scale timetabling problems with adaptive Tabu search

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/3619

Full metadata record

DC Field	Value	Language
dc.contributor.author	Al-kubaisi, Ali	-
dc.date.accessioned	2022-10-19T23:08:53Z	-
dc.date.available	2022-10-19T23:08:53Z	-
dc.date.issued	2021	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/3619	-
dc.description.abstract	Timetabling problems are specific types of scheduling problems that deal with assigning certain events to the timeslots. This assigning is subject to certain hard constraints that should be achieved to get a feasible timetable, as well as, soft constraints that must meet as many as possible during forming a feasible schedule. In this paper introduces an adaptive tabu search.	en_US
dc.language.iso	en	en_US
dc.publisher	Journal of Intelligent Systems	en_US
dc.subject	course timetabling	en_US
dc.subject	tabu search	en_US
dc.title	Large-scale timetabling problems with adaptive Tabu search	en_US
dc.type	Article	en_US
Appears in Collections:	مركز الحاسبة الالكترونية

Files in This Item:

File	Description	Size	Format
6 Large-scale timetabling problems with adaptive Tabu search.pdf		524.4 kB	Adobe PDF	View/Open