{"id":"https://openalex.org/W4308088198","doi":"https://doi.org/10.1109/seeda-cecnsm57760.2022.9932946","title":"A mathematical formulation for constructing feasible solutions for the Post Enrollment Course Timetabling Problem","display_name":"A mathematical formulation for constructing feasible solutions for the Post Enrollment Course Timetabling Problem","publication_year":2022,"publication_date":"2022-09-23","ids":{"openalex":"https://openalex.org/W4308088198","doi":"https://doi.org/10.1109/seeda-cecnsm57760.2022.9932946"},"language":"en","primary_location":{"id":"doi:10.1109/seeda-cecnsm57760.2022.9932946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/seeda-cecnsm57760.2022.9932946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 7th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007202717","display_name":"Angelos Dimitsas","orcid":"https://orcid.org/0000-0002-7892-046X"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Angelos Dimitsas","raw_affiliation_strings":["University of Ioannina,Dept. of Informatics & Telecommunications,Arta,Greece"],"affiliations":[{"raw_affiliation_string":"University of Ioannina,Dept. of Informatics & Telecommunications,Arta,Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026244951","display_name":"Vasileios Nastos","orcid":"https://orcid.org/0000-0002-1317-8639"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Vasileios Nastos","raw_affiliation_strings":["University of Ioannina,Dept. of Informatics & Telecommunications,Arta,Greece"],"affiliations":[{"raw_affiliation_string":"University of Ioannina,Dept. of Informatics & Telecommunications,Arta,Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012530516","display_name":"Christos Valouxis","orcid":"https://orcid.org/0000-0001-6832-2311"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos Valouxis","raw_affiliation_strings":["University of Patras,Dept. of Electrical & Computer Engineering,Rio,Greece"],"affiliations":[{"raw_affiliation_string":"University of Patras,Dept. of Electrical & Computer Engineering,Rio,Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049850289","display_name":"Christos Gogos","orcid":"https://orcid.org/0000-0003-1113-8462"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos Gogos","raw_affiliation_strings":["University of Ioannina,Dept. of Informatics & Telecommunications,Arta,Greece"],"affiliations":[{"raw_affiliation_string":"University of Ioannina,Dept. of Informatics & Telecommunications,Arta,Greece","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5007202717"],"corresponding_institution_ids":["https://openalex.org/I194019607"],"apc_list":null,"apc_paid":null,"fwci":0.1636,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5376633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7544161677360535},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6808688640594482},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6156187653541565},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5798556208610535},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4870498478412628},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.48072507977485657},{"id":"https://openalex.org/keywords/course","display_name":"Course (navigation)","score":0.47932398319244385},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4774927794933319},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46891865134239197},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4470573663711548},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.44271767139434814},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4287528097629547},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.12616774439811707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10560402274131775},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08138152956962585}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7544161677360535},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6808688640594482},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6156187653541565},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5798556208610535},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4870498478412628},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.48072507977485657},{"id":"https://openalex.org/C2777552389","wikidata":"https://www.wikidata.org/wiki/Q1962728","display_name":"Course (navigation)","level":2,"score":0.47932398319244385},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4774927794933319},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46891865134239197},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4470573663711548},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.44271767139434814},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4287528097629547},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.12616774439811707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10560402274131775},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08138152956962585},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/seeda-cecnsm57760.2022.9932946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/seeda-cecnsm57760.2022.9932946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 7th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4318717247","https://openalex.org/W2267656092","https://openalex.org/W2317874921","https://openalex.org/W2736755255","https://openalex.org/W4362648715","https://openalex.org/W2009385780","https://openalex.org/W3082623308","https://openalex.org/W3120503679","https://openalex.org/W2359390960","https://openalex.org/W3204654320"],"abstract_inverted_index":{"The":[0],"scheduling":[1],"community":[2],"has":[3,25],"long":[4],"been":[5,26,42,59],"interested":[6],"in":[7,11,44,102,109,147,164],"educational":[8,71],"timetabling.":[9],"Particularly":[10],"academia,":[12],"since":[13],"timetabling":[14,34,56,91],"dictates":[15],"the":[16,62,87,100,119,132,135,153,162,173],"day":[17,19,166,168],"to":[18,28,46,111,130],"operation":[20],"of":[21,55,121,134,152,161],"Universities,":[22],"great":[23],"effort":[24],"exercised":[27],"produce":[29],"high":[30],"quality":[31],"schedules.":[32],"Typically,":[33],"problems":[35,68],"are":[36],"NP-Hard":[37],"and":[38,84,105,116,137],"several":[39],"approaches":[40],"have":[41,58],"tried":[43],"order":[45,110],"generate":[47],"schedules":[48],"that":[49,98,128,144,170],"satisfy":[50],"all":[51],"stakeholders.":[52],"A":[53],"number":[54],"competitions":[57],"organized":[60],"through":[61],"last":[63],"two":[64,80],"decades":[65],"focusing":[66],"on":[67],"stemming":[69],"from":[70,79],"operations.":[72],"In":[73],"this":[74],"paper":[75],"we":[76,106],"use":[77,107,139],"data":[78],"such":[81],"competitions,":[82],"ITC2002":[83],"ITC2007":[85],"about":[86],"post":[88],"enrollment":[89],"course":[90],"problem.":[92],"We":[93,123,155],"propose":[94,157],"a":[95,125,158,165],"mathematical":[96],"model":[97,136],"captures":[99],"problem":[101,163],"its":[103],"entirety":[104],"it":[108],"construct":[112],"feasible":[113,175],"solutions":[114,146],"initially,":[115],"then":[117,138],"explore":[118],"prospect":[120],"optimization.":[122],"employ":[124],"pre-process":[126],"stage":[127],"attempts":[129],"reduce":[131],"size":[133],"an":[140],"open":[141],"source":[142],"solver,":[143],"produces":[145],"reasonable":[148],"time":[149],"for":[150],"most":[151],"cases.":[154],"also":[156],"simple":[159],"decomposition":[160],"by":[167],"basis":[169],"can":[171],"improve":[172],"initial":[174],"solutions.":[176]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}