{"id":"https://openalex.org/W2054573705","doi":"https://doi.org/10.1145/1068009.1068106","title":"On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems","display_name":"On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems","publication_year":2005,"publication_date":"2005-06-25","ids":{"openalex":"https://openalex.org/W2054573705","doi":"https://doi.org/10.1145/1068009.1068106","mag":"2054573705"},"language":"en","primary_location":{"id":"doi:10.1145/1068009.1068106","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5079846505","display_name":"Christian Gunia","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christian Gunia","raw_affiliation_strings":["University of Freiburg, Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079846505"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.207954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"571","last_page":"578"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9976999759674072,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9962000250816345,"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.665155291557312},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5996103882789612},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5344948172569275},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5229664444923401},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4604848325252533},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4511250853538513},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.43787842988967896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.388221800327301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22919589281082153},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2244509756565094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.665155291557312},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5996103882789612},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5344948172569275},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5229664444923401},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4604848325252533},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4511250853538513},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.43787842988967896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.388221800327301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22919589281082153},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2244509756565094},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1068009.1068106","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.335.9916","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.9916","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005/docs/p571.pdf","raw_type":"text"},{"id":"pmh:oai:freidok.uni-freiburg.de:55477","is_oa":false,"landing_page_url":"https://freidok.uni-freiburg.de/data/55477","pdf_url":null,"source":{"id":"https://openalex.org/S4306401057","display_name":"FreiDok plus (Universit\u00e4tsbibliothek Freiburg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I161046081","host_organization_name":"University of Freiburg","host_organization_lineage":["https://openalex.org/I161046081"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 2005 conference on Genetic and evolutionary computation - GECCO '05. - New York, New York, USA, 2005., ISBN: 1595930108","raw_type":"conference_object"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1510977876","https://openalex.org/W1522890465","https://openalex.org/W1573534773","https://openalex.org/W1593495653","https://openalex.org/W1636202028","https://openalex.org/W2011039300","https://openalex.org/W2024060531","https://openalex.org/W2067297441","https://openalex.org/W2089269509","https://openalex.org/W2093979815","https://openalex.org/W2151424660","https://openalex.org/W2165220807","https://openalex.org/W2295428206","https://openalex.org/W2911346016","https://openalex.org/W3122511378","https://openalex.org/W3138705879","https://openalex.org/W4213061626","https://openalex.org/W4285719527","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W85101999","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W2802808995","https://openalex.org/W2593449396","https://openalex.org/W2780789525","https://openalex.org/W2787833928"],"abstract_inverted_index":{"Two":[0],"of":[1,31,50,73,91,108],"the":[2,15,27,48,92],"major":[3],"difficulties":[4],"dealing":[5],"with":[6,85,100],"real-world":[7],"problems":[8],"nowadays":[9],"are":[10],"their":[11],"increasing":[12,117],"complexity":[13],"and":[14,26,40,110],"decreasing":[16,29],"available":[17],"timespan":[18],"to":[19,24,78,114],"create":[20],"\"acceptable\"":[21],"solutions.":[22],"Due":[23],"this":[25,44],"strongly":[28,58],"costs":[30],"CPU-power,":[32],"non":[33],"specialized":[34],"(random)":[35],"search":[36,54,95],"heuristics":[37,55,96],"gain":[38],"more":[39,41],"importance.":[42],"In":[43],"paper":[45],"we":[46],"analyze":[47],"behavior":[49],"two":[51,93],"very":[52],"simple":[53],"on":[56,104],"a":[57,101,105],"NP-hard":[59],"scheduling":[60],"problem.":[61],"Although":[62],"both":[63],"find":[64],"feasible":[65],"solutions":[66,112],"in":[67],"pseudo-polynomial":[68],"time,":[69],"at":[70],"least":[71],"one":[72,90],"them":[74],"is":[75],"not":[76],"able":[77],"present":[79],"an":[80],"(1+\u03b5)-approximation":[81],"for":[82,116],"arbitrary":[83],"\u03b5>0":[84],"constant":[86],"probability.":[87],"Despite":[88],"this,":[89],"presented":[94],"can":[97],"even":[98],"compete":[99],"problem-specific":[102],"algorithm":[103],"certain":[106],"class":[107],"inputs":[109],"deliver":[111],"convergent":[113],"optimality":[115],"problem":[118],"size.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}