{"id":"https://openalex.org/W6884515877","doi":"https://doi.org/10.1023/a%3a1018951218434","title":"Scheduling chicken catching - an investigation into the success of a genetic algorithm on a real world scheduling problem.","display_name":"Scheduling chicken catching - an investigation into the success of a genetic algorithm on a real world scheduling problem.","publication_year":1999,"publication_date":"1999-12-31","ids":{"openalex":"https://openalex.org/W6884515877","doi":"https://doi.org/10.1023/a%3a1018951218434"},"language":"en","primary_location":{"id":"pmh:oai:napier-surface.worktribe.com:282576","is_oa":false,"landing_page_url":"http://researchrepository.napier.ac.uk/id/eprint/3175","pdf_url":null,"source":{"id":"https://openalex.org/S4306400544","display_name":"Research Output (Edinburgh Napier University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I251738","host_organization_name":"Edinburgh Napier University","host_organization_lineage":["https://openalex.org/I251738"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},"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":null,"display_name":"Ross, Peter","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ross, Peter","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Nelson, Jeremy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nelson, Jeremy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66876519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.4074000120162964,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.4074000120162964,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.1987999975681305,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.052799999713897705,"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/scheduling","display_name":"Scheduling (production processes)","score":0.6326000094413757},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4959000051021576},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4659999907016754},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4440999925136566},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4088999927043915},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.40529999136924744}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.649399995803833},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6326000094413757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.545799970626831},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4959000051021576},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4659999907016754},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4440999925136566},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.40529999136924744},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.37770000100135803},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.31850001215934753},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.2533000111579895}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:napier-surface.worktribe.com:282576","is_oa":false,"landing_page_url":"http://researchrepository.napier.ac.uk/id/eprint/3175","pdf_url":null,"source":{"id":"https://openalex.org/S4306400544","display_name":"Research Output (Edinburgh Napier University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I251738","host_organization_name":"Edinburgh Napier University","host_organization_lineage":["https://openalex.org/I251738"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6048804521560669,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Genetic":[0],"Algorithms":[1],"(GAs)":[2],"are":[3],"a":[4,23,32,42,85,104,108,112,145,155],"class":[5],"of":[6,25,41,63,95,169],"evolutionary":[7],"algorithms":[8],"that":[9,68,121],"have":[10],"been":[11],"successfullyapplied":[12],"to":[13,54,78,106,139,166],"scheduling":[14,39],"problems,":[15],"in":[16,88],"particular":[17],"job-shop":[18],"and":[19,57,119,149],"flow-shop":[20],"type":[21,168],"problemswhere":[22],"number":[24],"theoretical":[26],"benchmarks":[27],"exist.":[28],"This":[29,129],"work":[30],"applies":[31],"genetic":[33,161],"algorithm":[34,142,162],"toa":[35],"real-world,":[36],"heavily":[37],"constrained":[38],"problem":[40,170],"local":[43],"chicken":[44],"factory,":[45],"where":[46],"thereis":[47],"no":[48],"benchmark":[49],"solution,":[50,113],"but":[51],"real-life":[52],"needs":[53],"produce":[55,73],"sensible":[56],"adaptable":[58],"schedules":[59,133],"ina":[60],"short":[61],"space":[62],"time.":[64],"The":[65,141],"results":[66],"show":[67],"the":[69,96,101,117,125,136,158,160],"GA":[70,105],"can":[71,131],"successfully":[72],"daily":[74],"schedulesin":[75],"minutes,":[76],"similar":[77],"those":[79],"currently":[80],"produced":[81],"by":[82,84],"hand":[83],"single":[86],"expert":[87],"several":[89],"days,and":[90],"furthermore":[91],"improve":[92],"certain":[93],"aspects":[94],"current":[97],"schedules.":[98],"We":[99,152],"explore":[100],"success":[102],"ofusing":[103],"evolve":[107],"strategy":[109],"for":[110,134],"producing":[111],"rather":[114],"than":[115],"evolving":[116],"solutionitself,":[118],"find":[120],"this":[122,167],"method":[123,130],"provides":[124],"most":[126],"flexible":[127],"approach.":[128],"producerobust":[132],"all":[135],"cases":[137],"presented":[138],"it.":[140],"itself":[143],"is":[144],"compromisebetween":[146],"an":[147,164],"indirect":[148],"direct":[150],"representation.":[151],"conclude":[153],"with":[154],"discussion":[156],"on":[157],"suitabilityof":[159],"as":[163],"approach":[165]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}