{"id":"https://openalex.org/W1975453560","doi":"https://doi.org/10.1145/1570256.1570397","title":"Minimizing total completion time in two-machine flow shops with exact delay using genetic algorithm & ant colony algorithm","display_name":"Minimizing total completion time in two-machine flow shops with exact delay using genetic algorithm & ant colony algorithm","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W1975453560","doi":"https://doi.org/10.1145/1570256.1570397","mag":"1975453560"},"language":"en","primary_location":{"id":"doi:10.1145/1570256.1570397","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1570256.1570397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","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/A5081739278","display_name":"Josh Glascock","orcid":null},"institutions":[{"id":"https://openalex.org/I117015748","display_name":"Purdue University Northwest","ror":"https://ror.org/04keq6987","country_code":"US","type":"education","lineage":["https://openalex.org/I117015748"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Josh Glascock","raw_affiliation_strings":["Purdue University Calumet, Hammond, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University Calumet, Hammond, IN, USA","institution_ids":["https://openalex.org/I117015748"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016578171","display_name":"Brian Hunter","orcid":null},"institutions":[{"id":"https://openalex.org/I117015748","display_name":"Purdue University Northwest","ror":"https://ror.org/04keq6987","country_code":"US","type":"education","lineage":["https://openalex.org/I117015748"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian Hunter","raw_affiliation_strings":["Purdue University Calumet, Hammond, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University Calumet, Hammond, IN, USA","institution_ids":["https://openalex.org/I117015748"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I117015748"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08413226,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2733","last_page":"2736"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9943000078201294,"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.9926000237464905,"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/algorithm","display_name":"Algorithm","score":0.821504533290863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6684250831604004},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5694820880889893},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5628305673599243},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5111060738563538},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42766839265823364},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.15640917420387268}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.821504533290863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6684250831604004},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5694820880889893},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5628305673599243},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5111060738563538},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42766839265823364},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.15640917420387268},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1570256.1570397","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1570256.1570397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4300000071525574}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309036","display_name":"Purdue University","ror":"https://ror.org/02dqehb95"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W78437532","https://openalex.org/W1981715983","https://openalex.org/W2022520278","https://openalex.org/W2043386117","https://openalex.org/W2081097282","https://openalex.org/W2088798907","https://openalex.org/W2097571405"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2182624400","https://openalex.org/W2767428579","https://openalex.org/W2073681303","https://openalex.org/W2365800168","https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W1992807692","https://openalex.org/W2078492738","https://openalex.org/W3014549013"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,49,52,65,70],"problem":[3],"of":[4,69],"minimizing":[5],"total":[6,66],"completion":[7,67],"time":[8,68],"in":[9],"a":[10,46,61],"two-machine":[11],"flow":[12],"shop":[13],"with":[14],"exact":[15],"delay.":[16],"There":[17],"are":[18],"n":[19],"jobs,":[20],"one":[21,26],"upstream":[22],"machine":[23,28,38,42],"M1":[24],"and":[25,44],"downstream":[27],"M2.":[29],"Each":[30],"job":[31],"has":[32,45],"to":[33,59],"be":[34],"processed":[35],"first":[36],"on":[37,41],"M1,":[39],"then":[40],"M2,":[43],"delay":[47,54],"between":[48],"machines":[50],"called":[51],"\"exact\"":[53],"time.":[55],"The":[56],"objective":[57],"is":[58],"find":[60],"schedule":[62],"that":[63],"minimizes":[64],"jobs.":[71]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}