{"id":"https://openalex.org/W1997697966","doi":"https://doi.org/10.1080/088395100117016","title":"University course timetabling using constraint handling rules","display_name":"University course timetabling using constraint handling rules","publication_year":2000,"publication_date":"2000-04-01","ids":{"openalex":"https://openalex.org/W1997697966","doi":"https://doi.org/10.1080/088395100117016","mag":"1997697966"},"language":"en","primary_location":{"id":"doi:10.1080/088395100117016","is_oa":false,"landing_page_url":"https://doi.org/10.1080/088395100117016","pdf_url":null,"source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"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/A5080036358","display_name":"Slim Abdennadher","orcid":"https://orcid.org/0000-0003-1817-1855"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Slim Abdennadher","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038418472","display_name":"Michael Marte","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Marte","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080036358"],"corresponding_institution_ids":[],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":null,"fwci":3.0269,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.91760232,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"4","first_page":"311","last_page":"325"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994000196456909,"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.9994000196456909,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9642999768257141,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8493351340293884},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7881594896316528},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.705241322517395},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.663761556148529},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6558489203453064},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.6478501558303833},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.5991679430007935},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.5837303996086121},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5631625652313232},{"id":"https://openalex.org/keywords/course","display_name":"Course (navigation)","score":0.5245157480239868},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5223135352134705},{"id":"https://openalex.org/keywords/problem-solver","display_name":"Problem solver","score":0.5173284411430359},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43997904658317566},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3861393332481384},{"id":"https://openalex.org/keywords/industrial-engineering","display_name":"Industrial engineering","score":0.3611176311969757},{"id":"https://openalex.org/keywords/software-engineering","display_name":"Software engineering","score":0.27148306369781494},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.256297767162323},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1745688021183014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07175642251968384}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8493351340293884},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7881594896316528},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.705241322517395},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.663761556148529},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6558489203453064},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.6478501558303833},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.5991679430007935},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.5837303996086121},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5631625652313232},{"id":"https://openalex.org/C2777552389","wikidata":"https://www.wikidata.org/wiki/Q1962728","display_name":"Course (navigation)","level":2,"score":0.5245157480239868},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5223135352134705},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.5173284411430359},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43997904658317566},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3861393332481384},{"id":"https://openalex.org/C13736549","wikidata":"https://www.wikidata.org/wiki/Q4489420","display_name":"Industrial engineering","level":1,"score":0.3611176311969757},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.27148306369781494},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.256297767162323},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1745688021183014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07175642251968384},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1080/088395100117016","is_oa":false,"landing_page_url":"https://doi.org/10.1080/088395100117016","pdf_url":null,"source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.5173","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.5173","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.guc.edu.eg/research/SA_TT/abdennadher00university.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.2307","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.2307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.pms.informatik.uni-muenchen.de/mitarbeiter/abdennad/Publikationen/paperAAI00.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.8271","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.8271","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.pms.informatik.uni-muenchen.de/publikationen/PMS-FB/PMS-FB-2000-2.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.65.5705","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.5705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.pms.ifi.lmu.de/publikationen/PMS-FB/PMS-FB-2000-2/PMS-FB-2000-2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1493927701","https://openalex.org/W1499633535","https://openalex.org/W1501271377","https://openalex.org/W1528090900","https://openalex.org/W1538054226","https://openalex.org/W1589232796","https://openalex.org/W1597583991","https://openalex.org/W1988095917","https://openalex.org/W2056229702","https://openalex.org/W2063727779","https://openalex.org/W2068852367","https://openalex.org/W2099942580","https://openalex.org/W2148546044","https://openalex.org/W2156525231","https://openalex.org/W2569549435","https://openalex.org/W2570710533","https://openalex.org/W2913256821","https://openalex.org/W2914764211"],"related_works":["https://openalex.org/W4303044088","https://openalex.org/W1486916474","https://openalex.org/W2140769824","https://openalex.org/W115413730","https://openalex.org/W2032348095","https://openalex.org/W2049055139","https://openalex.org/W2495408185","https://openalex.org/W2520084020","https://openalex.org/W2524435840","https://openalex.org/W2156897434"],"abstract_inverted_index":{"Timetabling":[0],"the":[1,5,10,15,86,98,101,127],"courses":[2],"offered":[3],"at":[4,126],"Computer":[6],"Science":[7],"Department":[8],"of":[9,12,17,85,97,100],"University":[11,142],"Munich":[13,132],"requires":[14],"processing":[16],"hard":[18],"and":[19,59,133],"soft":[20,30,74,80],"constraints.":[21],"Hard":[22],"constraints":[23,81],"are":[24,146],"conditions":[25],"that":[26],"must":[27],"be":[28,34,38],"satisfied,":[29],"constraints,":[31],"however,":[32],"may":[33],"violated,":[35],"but":[36],"should":[37],"satisfied":[39],"as":[40,42,53],"much":[41],"possible.":[43],"This":[44],"paper":[45],"shows":[46],"how":[47],"to":[48,111],"model":[49],"our":[50],"timetabling":[51,117,144],"problem":[52,58,87],"a":[54,61,108,113,120],"partial":[55],"constraint":[56,75],"satisfaction":[57],"gives":[60],"concise":[62],"finite":[63],"domain":[64],"solver":[65],"implemented":[66],"with":[67],"Constraint":[68],"Handling":[69],"Rules":[70],"that,":[71],"by":[72,94],"performing":[73],"propagation,":[76],"allows":[77],"for":[78,138],"making":[79],"an":[82],"active":[83],"part":[84],"solving":[88],"process.":[89],"Furthermore,":[90],"we":[91],"improve":[92],"efficiency":[93],"reusing":[95],"parts":[96],"timetable":[99,114],"previous":[102],"year.":[103],"Our":[104],"prototype":[105],"needs":[106],"only":[107],"few":[109,121],"minutes":[110],"create":[112],"while":[115],"manual":[116],"usually":[118],"takes":[119],"days.":[122],"It":[123],"was":[124],"presented":[125],"Systems'98":[128],"computer":[129],"fair":[130],"in":[131],"several":[134],"universities":[135],"have":[136],"enquired":[137],"it.":[139],"1":[140],"Introduction":[141],"course":[143],"problems":[145],"combinatori...":[147]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}