{"id":"https://openalex.org/W4240363831","doi":"https://doi.org/10.1504/ijmheur.2016.10001113","title":"Simulated annealing for the uncapacitated exam scheduling problem","display_name":"Simulated annealing for the uncapacitated exam scheduling problem","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W4240363831","doi":"https://doi.org/10.1504/ijmheur.2016.10001113"},"language":"en","primary_location":{"id":"doi:10.1504/ijmheur.2016.10001113","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmheur.2016.10001113","pdf_url":null,"source":{"id":"https://openalex.org/S206578720","display_name":"International Journal of Metaheuristics","issn_l":"1755-2176","issn":["1755-2176","1755-2184"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Metaheuristics","raw_type":"journal-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/A5041767573","display_name":"Salim Haddadi","orcid":"https://orcid.org/0000-0001-8347-169X"},"institutions":[{"id":"https://openalex.org/I4210097536","display_name":"University of Guelma","ror":"https://ror.org/00xe6p546","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210097536"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Salim Haddadi","raw_affiliation_strings":["LabSTIC, 8 Mai 1945 University, Guelma, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LabSTIC, 8 Mai 1945 University, Guelma, Algeria","institution_ids":["https://openalex.org/I4210097536"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048515725","display_name":"Meryem Cheraitia","orcid":"https://orcid.org/0000-0003-3642-5572"},"institutions":[{"id":"https://openalex.org/I4210097536","display_name":"University of Guelma","ror":"https://ror.org/00xe6p546","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210097536"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Meryem Cheraitia","raw_affiliation_strings":["LabSTIC, 8 Mai 1945 University, Guelma, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LabSTIC, 8 Mai 1945 University, Guelma, Algeria","institution_ids":["https://openalex.org/I4210097536"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210097536"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.37982775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"5","issue":"2","first_page":"156","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9952999949455261,"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.9952999949455261,"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/T11902","display_name":"Intelligent Tutoring Systems and Adaptive Learning","score":0.9718999862670898,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.762718677520752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7214025259017944},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6588401198387146},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6158961057662964},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5602906942367554},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5494359135627747},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.45287618041038513},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44725117087364197},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24499943852424622},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20204544067382812},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1667962372303009},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15834930539131165},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08636558055877686}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.762718677520752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7214025259017944},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6588401198387146},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6158961057662964},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5602906942367554},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5494359135627747},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.45287618041038513},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44725117087364197},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24499943852424622},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20204544067382812},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1667962372303009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15834930539131165},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08636558055877686},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijmheur.2016.10001113","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmheur.2016.10001113","pdf_url":null,"source":{"id":"https://openalex.org/S206578720","display_name":"International Journal of Metaheuristics","issn_l":"1755-2176","issn":["1755-2176","1755-2184"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Metaheuristics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W2745001401","https://openalex.org/W4321353415","https://openalex.org/W2130974462","https://openalex.org/W972276598","https://openalex.org/W4246352526","https://openalex.org/W2028665553","https://openalex.org/W2086519370","https://openalex.org/W2087343574","https://openalex.org/W3204654320"],"abstract_inverted_index":{"The":[0],"uncapacitated":[1],"exam":[2],"scheduling":[3],"problem":[4],"asks":[5],"for":[6,60],"a":[7,11,17,38,45],"conflict-free":[8],"assignment":[9],"of":[10,13,20,64],"set":[12,75],"given":[14],"exams":[15,26],"into":[16],"limited":[18],"number":[19],"time":[21],"slots":[22],"such":[23],"that":[24,77],"conflicting":[25,66],"are":[27],"spread":[28],"as":[29,31,56],"evenly":[30],"possible.":[32],"In":[33],"our":[34,78],"proposed":[35],"approach,":[36],"using":[37],"simple":[39],"graph":[40],"colouring":[41],"heuristic,":[42],"we":[43],"construct":[44],"feasible":[46],"timetable":[47],"to":[48],"start":[49],"with.":[50],"Simulated":[51],"Annealing":[52],"is":[53],"then":[54],"used":[55],"an":[57],"iterative":[58],"heuristic":[59],"improving":[61],"the":[62,65,71],"spreading":[63],"exams.":[67],"Our":[68],"results":[69,82],"on":[70],"Toronto":[72],"benchmark":[73],"data":[74],"show":[76],"approach":[79],"provides":[80],"good":[81],"and":[83],"turns":[84],"out":[85],"competitive":[86],"with":[87],"10":[88],"recent":[89],"existing":[90],"methods.":[91]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}