{"id":"https://openalex.org/W2043386117","doi":"https://doi.org/10.1057/palgrave.jors.2601766","title":"A genetic algorithm for flow shop scheduling problems","display_name":"A genetic algorithm for flow shop scheduling problems","publication_year":2004,"publication_date":"2004-04-21","ids":{"openalex":"https://openalex.org/W2043386117","doi":"https://doi.org/10.1057/palgrave.jors.2601766","mag":"2043386117"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2601766","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601766","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","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/A5065709031","display_name":"O Etiler","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"O Etiler","raw_affiliation_strings":["\u015eI\u015eECAM Mersin Turkey"],"affiliations":[{"raw_affiliation_string":"\u015eI\u015eECAM Mersin Turkey","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006044292","display_name":"Bilal Toklu","orcid":"https://orcid.org/0000-0001-5094-1501"},"institutions":[{"id":"https://openalex.org/I95634034","display_name":"Gazi University","ror":"https://ror.org/054xkpr46","country_code":"TR","type":"education","lineage":["https://openalex.org/I95634034"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"B Toklu","raw_affiliation_strings":["Gazi University Ankara Turkey","Gazi University, ANKARA, Turkey"],"affiliations":[{"raw_affiliation_string":"Gazi University Ankara Turkey","institution_ids":["https://openalex.org/I95634034"]},{"raw_affiliation_string":"Gazi University, ANKARA, Turkey","institution_ids":["https://openalex.org/I95634034"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091196661","display_name":"Mehmet Atak","orcid":"https://orcid.org/0000-0002-4373-5192"},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M Atak","raw_affiliation_strings":["Loughborough University Loughborough UK"],"affiliations":[{"raw_affiliation_string":"Loughborough University Loughborough UK","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078387936","display_name":"John Wilson","orcid":"https://orcid.org/0000-0001-8488-3020"},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J Wilson","raw_affiliation_strings":["Loughborough University Loughborough UK"],"affiliations":[{"raw_affiliation_string":"Loughborough University Loughborough UK","institution_ids":["https://openalex.org/I143804889"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5065709031"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.8736,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.95251898,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"55","issue":"8","first_page":"830","last_page":"835"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9926999807357788,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9891999959945679,"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/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.8055654168128967},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.780127763748169},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7169204950332642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6611182689666748},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6380881071090698},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5422019362449646},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5321679711341858},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4668263792991638},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.45405322313308716},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4270741939544678},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35274267196655273},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2131931483745575},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10197010636329651}],"concepts":[{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.8055654168128967},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.780127763748169},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7169204950332642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6611182689666748},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6380881071090698},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5422019362449646},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5321679711341858},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4668263792991638},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.45405322313308716},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4270741939544678},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35274267196655273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2131931483745575},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10197010636329651},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/palgrave.jors.2601766","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601766","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:55:y:2004:i:8:d:10.1057_palgrave.jors.2601766","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2601766","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1507363803","https://openalex.org/W1511493290","https://openalex.org/W1522503496","https://openalex.org/W1639032689","https://openalex.org/W1971769204","https://openalex.org/W1981123047","https://openalex.org/W1984701290","https://openalex.org/W1996504887","https://openalex.org/W2007676373","https://openalex.org/W2019192981","https://openalex.org/W2019682546","https://openalex.org/W2024085737","https://openalex.org/W2026541491","https://openalex.org/W2032257665","https://openalex.org/W2066531342","https://openalex.org/W2070124709","https://openalex.org/W2090069860","https://openalex.org/W2092732888","https://openalex.org/W2105854030","https://openalex.org/W2118371226","https://openalex.org/W2149027038","https://openalex.org/W2151445405","https://openalex.org/W2164866963","https://openalex.org/W2166843422","https://openalex.org/W2904250082","https://openalex.org/W2976664243","https://openalex.org/W3023540311","https://openalex.org/W4230214681","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2225350526","https://openalex.org/W2373973180","https://openalex.org/W2949165180","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2538210412","https://openalex.org/W2384952691"],"abstract_inverted_index":{"Abstract":[0],"Many":[1],"scheduling":[2,36,67],"problems":[3],"are":[4],"NP-hard":[5,9],"problems.":[6,68],"For":[7],"such":[8],"combinatorial":[10],"optimization":[11],"problems,":[12],"heuristics":[13],"play":[14],"a":[15,28],"major":[16],"role":[17],"in":[18],"searching":[19],"for":[20,32,65],"near-optimal":[21],"solutions.":[22],"In":[23],"this":[24],"paper":[25],"we":[26],"develop":[27],"genetic":[29,59],"algorithm-based":[30],"heuristic":[31],"the":[33,41,46,51],"flow":[34],"shop":[35],"problem":[37],"with":[38,50],"makespan":[39],"as":[40],"criterion.":[42],"The":[43],"performance":[44],"of":[45],"algorithm":[47],"is":[48],"compared":[49],"established":[52],"NEH":[53],"algorithm.":[54],"Computational":[55],"experience":[56],"indicates":[57],"that":[58],"algorithms":[60],"can":[61],"be":[62],"good":[63],"techniques":[64],"flowshop":[66]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":12}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}