A Review of Optimization Algorithms for University Timetable Scheduling

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. Developing a timetable is a fundamental requirement for the healthy functioning of all education...

Full description

Saved in:
Bibliographic Details
Published in:Engineering, technology & applied science research Vol. 10; no. 6; pp. 6410 - 6417
Main Authors: Alghamdi, H., Alsubait, T., Alhakami, H., Baz, A.
Format: Journal Article
Language:English
Published: 01.12.2020
ISSN:2241-4487, 1792-8036
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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. Developing a timetable is a fundamental requirement for the healthy functioning of all educational and administrative parts of an academic institution. However, factors such as the availability of hours, the number of subjects, and the allocation of teachers make the timetable problem very complex. This study intends to review several optimization algorithms that could be applied as possible solutions for the university student course timetable problem. The reviewed algorithms take into account the demands of institutional constraints for course timetable management.
AbstractList 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. Developing a timetable is a fundamental requirement for the healthy functioning of all educational and administrative parts of an academic institution. However, factors such as the availability of hours, the number of subjects, and the allocation of teachers make the timetable problem very complex. This study intends to review several optimization algorithms that could be applied as possible solutions for the university student course timetable problem. The reviewed algorithms take into account the demands of institutional constraints for course timetable management.
Author Alhakami, H.
Baz, A.
Alsubait, T.
Alghamdi, H.
Author_xml – sequence: 1
  givenname: H.
  surname: Alghamdi
  fullname: Alghamdi, H.
– sequence: 2
  givenname: T.
  surname: Alsubait
  fullname: Alsubait, T.
– sequence: 3
  givenname: H.
  surname: Alhakami
  fullname: Alhakami, H.
– sequence: 4
  givenname: A.
  surname: Baz
  fullname: Baz, A.
BookMark eNptkEtPAjEUhRuDiYis_APdm8E-7kw7S0IUTEhIFNeTtrRQMw_SVgz-esfRlfFuzubce-75rtGo7VqL0C0lM5BEwr1NKoYZl5xdoDEVJcsk4cUIjRkDmgFIcYWmMb6RfgpZgGBjtJzjZ3vy9gN3Dm-OyTf-UyXftXhe77vg06GJ2HUBv7b-ZEP06Yy3vumjdG3xiznY3Xvt2_0NunSqjnb6qxO0fXzYLlbZerN8WszXmWGCpKzIwfTPCAFMa86NdiCVM5Y6mZcK8p0oidiBtkKD4YXsizELhroStFSWT9Ddz1kTuhiDddUx-EaFc0VJNVCoBgrVN4XeTf-4jU9DuxSUr__d-QLgYGQp
CitedBy_id crossref_primary_10_1155_2022_1971341
crossref_primary_10_1016_j_techfore_2024_123687
crossref_primary_10_3390_e24091280
crossref_primary_10_3390_computation13010010
crossref_primary_10_3390_e24111511
crossref_primary_10_3390_sym14102023
crossref_primary_10_22630_EIOL_2022_7_1_11
crossref_primary_10_1007_s00521_024_10941_5
crossref_primary_10_22630_EIOL_2022_7_2_11
crossref_primary_10_3390_en15103718
Cites_doi 10.1007/s00291-008-0143-6
10.1007/s10489-018-1258-3
10.1007/s10845-015-1039-3
10.1007/s11276-014-0822-y
10.1007/s10479-016-2321-2
10.1007/s10479-014-1641-3
10.3390/s20051503
10.1007/s10479-009-0659-4
10.1108/AA-06-2017-071
10.1007/s10479-015-2094-z
10.1007/s12469-016-0128-9
10.1007/s10288-013-0242-3
10.4314/njt.v39i1.1
10.1007/s12469-015-0115-6
10.1016/j.array.2020.100031
10.5121/ijcsit.2018.10106
10.11648/j.ijdst.20170302.12
10.1007/s10957-018-1404-4
10.5120/ijais2017451700
10.1108/ECAM-11-2014-0135
10.4236/jmf.2019.93016
10.1007/s10462-015-9437-7
10.1088/1742-6596/893/1/012068
10.1007/s10462-013-9399-6
10.1007/s00500-016-2474-6
10.1088/1741-2552/aa8270
10.1007/s10479-017-2688-8
10.1007/s10732-018-9371-3
10.3390/mca25010007
10.1007/s10732-007-9019-1
10.1088/1757-899X/308/1/012046
10.5120/cae2018652804
10.1007/978-981-13-6347-4_11
10.1007/s11042-018-6355-0
10.1108/EC-01-2019-0025
10.1108/IMDS-08-2016-0331
10.1186/s40537-017-0084-5
10.1007/s10618-011-0247-5
10.1023/A:1021841728075
10.1007/s10479-014-1688-1
10.1007/s10479-010-0769-z
10.1007/s11390-017-1781-4
10.1007/s12469-013-0062-z
10.1057/jors.2012.169
10.1063/1.5055403
10.1007/s11235-016-0237-4
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.48084/etasr.3832
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1792-8036
EndPage 6417
ExternalDocumentID 10_48084_etasr_3832
GroupedDBID .4S
5VS
AAYXX
ADBBV
AEGXH
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EDO
EJD
ITG
ITH
KWQ
OK1
RNS
TUS
ID FETCH-LOGICAL-c270t-654c2417742bb33cbf48afce1f859a45d7907d4be7b4c3684802e4c1f94b8ae3
ISICitedReferencesCount 17
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000600434200005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2241-4487
IngestDate Sat Nov 29 03:45:06 EST 2025
Tue Nov 18 22:45:28 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c270t-654c2417742bb33cbf48afce1f859a45d7907d4be7b4c3684802e4c1f94b8ae3
OpenAccessLink https://doi.org/10.48084/etasr.3832
PageCount 8
ParticipantIDs crossref_primary_10_48084_etasr_3832
crossref_citationtrail_10_48084_etasr_3832
PublicationCentury 2000
PublicationDate 2020-12-01
PublicationDateYYYYMMDD 2020-12-01
PublicationDate_xml – month: 12
  year: 2020
  text: 2020-12-01
  day: 01
PublicationDecade 2020
PublicationTitle Engineering, technology & applied science research
PublicationYear 2020
References 79371
79370
79373
79372
79375
79374
79377
79376
79379
79378
79360
79362
79361
79364
79363
79366
79365
79368
79401
79367
79400
79403
79369
79402
79405
79404
79407
79406
79408
79391
79390
79393
79392
79351
79395
79350
79394
79353
79397
79352
79396
79355
79399
79354
79398
79357
79356
79359
79358
79380
79382
79381
79384
79383
79342
79386
79385
79344
79388
79343
79387
79346
79345
79389
79348
79347
79349
References_xml – ident: 79388
  doi: 10.1007/s00291-008-0143-6
– ident: 79401
  doi: 10.1007/s10489-018-1258-3
– ident: 79402
– ident: 79368
– ident: 79403
  doi: 10.1007/s10845-015-1039-3
– ident: 79374
– ident: 79389
  doi: 10.1007/s11276-014-0822-y
– ident: 79370
  doi: 10.1007/s10479-016-2321-2
– ident: 79386
  doi: 10.1007/s10479-014-1641-3
– ident: 79378
  doi: 10.3390/s20051503
– ident: 79390
  doi: 10.1007/s10479-009-0659-4
– ident: 79345
  doi: 10.1108/AA-06-2017-071
– ident: 79367
  doi: 10.1007/s10479-015-2094-z
– ident: 79355
  doi: 10.1007/s12469-016-0128-9
– ident: 79365
  doi: 10.1007/s10288-013-0242-3
– ident: 79384
– ident: 79362
  doi: 10.4314/njt.v39i1.1
– ident: 79407
  doi: 10.1007/s12469-015-0115-6
– ident: 79377
– ident: 79380
  doi: 10.1016/j.array.2020.100031
– ident: 79406
– ident: 79346
  doi: 10.5121/ijcsit.2018.10106
– ident: 79356
– ident: 79394
– ident: 79344
  doi: 10.11648/j.ijdst.20170302.12
– ident: 79363
  doi: 10.1007/s10957-018-1404-4
– ident: 79347
  doi: 10.5120/ijais2017451700
– ident: 79385
– ident: 79393
  doi: 10.1108/ECAM-11-2014-0135
– ident: 79381
– ident: 79351
  doi: 10.4236/jmf.2019.93016
– ident: 79366
  doi: 10.1007/s10462-015-9437-7
– ident: 79343
– ident: 79375
  doi: 10.1088/1742-6596/893/1/012068
– ident: 79371
  doi: 10.1007/s10462-013-9399-6
– ident: 79400
  doi: 10.1007/s00500-016-2474-6
– ident: 79352
  doi: 10.1088/1741-2552/aa8270
– ident: 79348
  doi: 10.1007/s10479-015-2094-z
– ident: 79350
  doi: 10.1007/s10479-017-2688-8
– ident: 79372
  doi: 10.1007/s10732-018-9371-3
– ident: 79379
  doi: 10.3390/mca25010007
– ident: 79357
– ident: 79391
  doi: 10.1007/s10732-007-9019-1
– ident: 79349
  doi: 10.1088/1757-899X/308/1/012046
– ident: 79395
– ident: 79353
– ident: 79359
  doi: 10.5120/cae2018652804
– ident: 79360
  doi: 10.1007/978-981-13-6347-4_11
– ident: 79354
  doi: 10.1007/s11042-018-6355-0
– ident: 79398
  doi: 10.1108/EC-01-2019-0025
– ident: 79383
  doi: 10.1108/IMDS-08-2016-0331
– ident: 79376
  doi: 10.1186/s40537-017-0084-5
– ident: 79382
– ident: 79387
  doi: 10.1007/s10618-011-0247-5
– ident: 79364
  doi: 10.1023/A:1021841728075
– ident: 79369
  doi: 10.1007/s10479-014-1688-1
– ident: 79408
  doi: 10.1007/s10479-010-0769-z
– ident: 79361
– ident: 79396
– ident: 79399
  doi: 10.1007/s11390-017-1781-4
– ident: 79405
  doi: 10.1007/s12469-013-0062-z
– ident: 79373
  doi: 10.1057/jors.2012.169
– ident: 79342
  doi: 10.1063/1.5055403
– ident: 79404
– ident: 79358
– ident: 79392
– ident: 79397
  doi: 10.1007/s11235-016-0237-4
SSID ssj0000686472
ssib044735913
ssib050383323
Score 2.3172257
Snippet The university course timetabling problem looks for the best schedule, to satisfy given criteria as a set of given resources, which may contain lecturers,...
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 6410
Title A Review of Optimization Algorithms for University Timetable Scheduling
Volume 10
WOSCitedRecordID wos000600434200005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1792-8036
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044735913
  issn: 2241-4487
  databaseCode: M~E
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07b9swECbctEM7FOkLTR8Bh0wt5NIiJZKjWiTp0rRAPWQzSIqKjdhyYCtBpv6M_t4eST3YwEM6dBFkiqQkfx_ujifeHUJHjNiSguGamEkuEyY0SxRhLAHtYibM0pKSyheb4Gdn4vxc_hiNfnexMDdLXtfi9lZe_VeooQ3AdqGz_wB3Pyk0wDmADkeAHY73Ar7okuWDGfgdBMKqjbT8WCwv1ptFMw8pGOItGS4OpPExVD8Bw9JtTr_4y2U_JC10kDS9O94TR7WGbBch1OYP6v3McN-5WpWhPPZ4aN1ea7XwOmAatc7VpVrd6ftZeTd3MY59FGm838OLMmcnJLAQDKrVBlHLJchiEtKf9LKYRJyLBWvO2ku2-8l3KQAmiGAO9kZtN2NYfaeDnuu-7d9Rf_2mRFgO-eEzP3jmBj9AD1OeSSctv_067uQUc-Wao6-7LqMOpa2ZFSwA4bLyu7qG3YuH0FA__6fh4SJjKLJqpvvoabscwUWg0TM0svVz9CTC-wU6LXAgFF5XOCYUHgiFgVB4IBTuCYUHQr1E05Pj6ZevSVt-IzEpJ02SZ8zA48P6INWaUqMrJlRl7KQSmVQsK7kkvGTacs0MzQW8XGqZmVSSaaEsfYX26nVtXyNspJauUEEOs4BFCONAPZOSKg3WYlaaA_Sh-xtmpk1N7yqkLGc7MDlAR33nq5CRZVe3N_fr9hY9Hgj7Du01m2v7Hj0yN81iuzn0sP8BvUp-Zw
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Review+of+Optimization+Algorithms+for+University+Timetable+Scheduling&rft.jtitle=Engineering%2C+technology+%26+applied+science+research&rft.au=Alghamdi%2C+H.&rft.au=Alsubait%2C+T.&rft.au=Alhakami%2C+H.&rft.au=Baz%2C+A.&rft.date=2020-12-01&rft.issn=2241-4487&rft.eissn=1792-8036&rft.volume=10&rft.issue=6&rft.spage=6410&rft.epage=6417&rft_id=info:doi/10.48084%2Fetasr.3832&rft.externalDBID=n%2Fa&rft.externalDocID=10_48084_etasr_3832
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2241-4487&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2241-4487&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2241-4487&client=summon