{"id":"https://openalex.org/W95672859","doi":null,"title":"Genetic algorithms in timetabling and scheduling","display_name":"Genetic algorithms in timetabling and scheduling","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W95672859","mag":"95672859"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.6442","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.6442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.dai.ed.ac.uk/pub/user/chrisg/Fang.Phd.Thesis.ps.gz","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"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/A5114259710","display_name":"Hsiao-Lan Fang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hsiao-Lan Fang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5114259710"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0897,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.84307781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.0,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0,"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":[{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9990000128746033},{"id":"https://openalex.org/keywords/timetabling","display_name":"timetabling","score":0.984000027179718},{"id":"https://openalex.org/keywords/scheduling","display_name":"scheduling","score":0.8960000276565552},{"id":"https://openalex.org/keywords/educational-institutions","display_name":"educational institutions","score":0.8489999771118164},{"id":"https://openalex.org/keywords/evaluation-function","display_name":"evaluation function","score":0.8080000281333923},{"id":"https://openalex.org/keywords/mutation-operator","display_name":"mutation operator","score":0.8330000042915344},{"id":"https://openalex.org/keywords/algorithm-reliability","display_name":"algorithm reliability","score":0.42500001192092896},{"id":"https://openalex.org/keywords/robustness","display_name":"robustness","score":0.699999988079071}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6182788610458374},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49089986085891724},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.42161881923675537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3661881387233734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3395978808403015},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.18864953517913818},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17406463623046875}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.6442","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.6442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.dai.ed.ac.uk/pub/user/chrisg/Fang.Phd.Thesis.ps.gz","raw_type":"text"},{"id":"pmh:oai:era.ed.ac.uk:1842/30185","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/1842/30185","pdf_url":null,"source":{"id":"https://openalex.org/S7407055182","display_name":"ERA","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis or Dissertation"},{"id":"mag:95672859","doi":null,"is_oa":false,"landing_page_url":"https://era.ed.ac.uk/handle/1842/30185","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7096214168","https://openalex.org/W2020713725","https://openalex.org/W2029670046","https://openalex.org/W7098710573","https://openalex.org/W2363726406","https://openalex.org/W2294229675","https://openalex.org/W7097481790","https://openalex.org/W7098792078","https://openalex.org/W2122075717","https://openalex.org/W2265080090"],"abstract_inverted_index":{"This":[0],"thesis":[1],"investigates":[2],"the":[3,72,83,88,131,142],"use":[4,132],"of":[5,13,82,87,101,112,133,144],"genetic":[6],"algorithms":[7],"(GAs)":[8],"for":[9,40,127],"solving":[10],"a":[11,28,59,65,79,98,145],"range":[12],"timetabling":[14,45,103],"and":[15,25,30,63,78,85,106],"scheduling":[16],"problems.":[17],"Such":[18],"problems":[19,46],"are":[20,76],"very":[21],"hard":[22],"in":[23,47,122],"general,":[24],"GAs":[26,41],"offer":[27],"useful":[29],"successful":[31],"alternative":[32],"to":[33,42,68,70,110],"existing":[34],"techniques.":[35],"A":[36],"framework":[37],"is":[38,90,107,120],"presented":[39],"solve":[43,71],"modular":[44],"educational":[48],"institutions.":[49],"The":[50,92,124],"approach":[51,89,94,125],"involves":[52],"three":[53],"components:":[54],"declaring":[55],"problemspecific":[56],"constraints,":[57,105],"constructing":[58],"problem-specific":[60],"evaluation":[61],"function":[62],"using":[64],"problem-independent":[66],"GA":[67],"attempt":[69],"problem.":[73],"Successful":[74],"results":[75],"demonstrated":[77],"general":[80,102],"analysis":[81],"reliability":[84],"robustness":[86],"conducted.":[91],"basic":[93],"can":[95],"readily":[96],"handle":[97],"wide":[99],"variety":[100],"problem":[104],"therefore":[108],"likely":[109],"be":[111],"great":[113],"practical":[114],"usefulness":[115],"(indeed,":[116],"an":[117],"earlier":[118],"version":[119],"already":[121],"use).":[123],"relies":[126],"its":[128],"success":[129],"on":[130],"specially":[134],"designed":[135],"mutation":[136],"operators":[137],"which":[138],"greatly":[139],"improve":[140],"upon":[141],"performance":[143],"GA...":[146]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-10-31T12:09:11.096373","created_date":"2016-06-24T00:00:00"}