{"id":"https://openalex.org/W2024819099","doi":"https://doi.org/10.4018/jamc.2011070102","title":"Parallel Scatter Search Algorithms for Exam Timetabling","display_name":"Parallel Scatter Search Algorithms for Exam Timetabling","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2024819099","doi":"https://doi.org/10.4018/jamc.2011070102","mag":"2024819099"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2011070102","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5111391750","display_name":"Nashat Mansour","orcid":null},"institutions":[{"id":"https://openalex.org/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"funder","lineage":["https://openalex.org/I56306041"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Nashat Mansour","raw_affiliation_strings":["Lebanese American University , Lebanon"],"affiliations":[{"raw_affiliation_string":"Lebanese American University , Lebanon","institution_ids":["https://openalex.org/I56306041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078301630","display_name":"Ghia Sleiman-Haidar","orcid":null},"institutions":[{"id":"https://openalex.org/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"funder","lineage":["https://openalex.org/I56306041"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Ghia Sleiman-Haidar","raw_affiliation_strings":["Lebanese American University , Lebanon"],"affiliations":[{"raw_affiliation_string":"Lebanese American University , Lebanon","institution_ids":["https://openalex.org/I56306041"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.363,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":3,"citation_normalized_percentile":{"value":0.666898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":76,"max":78},"biblio":{"volume":"2","issue":"3","first_page":"27","last_page":"44"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":1.0,"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":1.0,"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.9861,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9329,"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"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.73599446},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.55086076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.52799416},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5243248},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5239249},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.51804376},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44977164},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41442156},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37766397},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22213772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18957618},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"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":[{"is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2011070102","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality education","id":"https://metadata.un.org/sdg/4","score":0.4}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":31,"referenced_works":["https://openalex.org/W1490455848","https://openalex.org/W1510083951","https://openalex.org/W1546012270","https://openalex.org/W1551167422","https://openalex.org/W1568673319","https://openalex.org/W1826695536","https://openalex.org/W1964072303","https://openalex.org/W1964209858","https://openalex.org/W1970706073","https://openalex.org/W2014856631","https://openalex.org/W2026566141","https://openalex.org/W2031179475","https://openalex.org/W2063076812","https://openalex.org/W2090782061","https://openalex.org/W2092856865","https://openalex.org/W2093789277","https://openalex.org/W2097428991","https://openalex.org/W2099942580","https://openalex.org/W2104539127","https://openalex.org/W2112634036","https://openalex.org/W2116045745","https://openalex.org/W2116655538","https://openalex.org/W2120593497","https://openalex.org/W2135474087","https://openalex.org/W2153446897","https://openalex.org/W2807926675","https://openalex.org/W3628730","https://openalex.org/W4240160161","https://openalex.org/W4255486187","https://openalex.org/W4285719527","https://openalex.org/W68587524"],"related_works":["https://openalex.org/W90886653","https://openalex.org/W4312928368","https://openalex.org/W4302010637","https://openalex.org/W4220945639","https://openalex.org/W2794473043","https://openalex.org/W2077549107","https://openalex.org/W1981770370","https://openalex.org/W1777480463","https://openalex.org/W1586280759","https://openalex.org/W1521720388"],"abstract_inverted_index":{"University":[0],"exam":[1,66],"timetabling":[2,20],"refers":[3],"to":[4,50,88],"scheduling":[5],"exams":[6,43],"into":[7],"predefined":[8],"days,":[9],"time":[10,52],"periods":[11],"and":[12,44,86,91,131],"rooms,":[13],"given":[14],"a":[15,22,69,75,82,112,117],"set":[16],"of":[17,42,84,108,114,124,166],"constraints.":[18],"Exam":[19],"is":[21,74],"computationally":[23],"intractable":[24],"optimization":[25],"problem,":[26],"which":[27],"requires":[28],"heuristic":[29],"techniques":[30,134],"for":[31,62],"producing":[32,63],"adequate":[33],"solutions":[34,80,110],"within":[35,170],"reasonable":[36,70,171],"execution":[37],"time.":[38,71],"For":[39],"large":[40],"numbers":[41],"students,":[45],"sequential":[46,177],"algorithms":[47,61,100,146,157],"are":[48,102,127,135],"likely":[49],"be":[51],"consuming.":[53],"This":[54],"paper":[55],"presents":[56],"parallel":[57,97,130,143,154],"scatter":[58,98,125,144,155],"search":[59,73,92,99,126,145,156,168],"meta-heuristic":[60],"good":[64,148],"sub-optimal":[65],"timetables":[67],"in":[68,116,129,173],"Scatter":[72],"population-based":[76],"approach":[77],"that":[78,101,140,153],"generates":[79],"over":[81,111],"number":[83,113],"iterations":[85],"aims":[87],"combine":[89],"diversification":[90],"intensification.":[93],"The":[94,121],"authors":[95],"propose":[96],"based":[103],"on":[104],"distributing":[105],"the":[106,141,167,176],"population":[107],"candidate":[109],"processors":[115],"PC":[118],"cluster":[119],"environment.":[120],"main":[122],"components":[123],"computed":[128],"efficient":[132],"communication":[133],"employed.":[136],"Empirical":[137],"results":[138],"show":[139,152],"proposed":[142],"yield":[147],"speed-up.":[149],"Also,":[150],"they":[151,162],"improve":[158],"solution":[159],"quality":[160],"because":[161],"explore":[163],"larger":[164],"parts":[165],"space":[169],"time,":[172],"contrast":[174],"with":[175],"algorithm.":[178]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2024819099","counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-03-22T02:14:59.646787","created_date":"2016-06-24"}