{"id":"https://openalex.org/W2093414995","doi":"https://doi.org/10.1177/0037549712459789","title":"A new critical path method and a memetic algorithm for flexible job shop scheduling with overlapping operations","display_name":"A new critical path method and a memetic algorithm for flexible job shop scheduling with overlapping operations","publication_year":2012,"publication_date":"2012-11-12","ids":{"openalex":"https://openalex.org/W2093414995","doi":"https://doi.org/10.1177/0037549712459789","mag":"2093414995"},"language":"en","primary_location":{"id":"doi:10.1177/0037549712459789","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0037549712459789","pdf_url":null,"source":{"id":"https://openalex.org/S32573412","display_name":"SIMULATION","issn_l":"0037-5497","issn":["0037-5497","1741-3133"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIMULATION","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/A5037176755","display_name":"Hiwa Farughi","orcid":"https://orcid.org/0000-0001-9745-9691"},"institutions":[{"id":"https://openalex.org/I3124704065","display_name":"University of Kurdistan","ror":"https://ror.org/04k89yk85","country_code":"IR","type":"education","lineage":["https://openalex.org/I3124704065"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Hiwa Farughi","raw_affiliation_strings":["Industrial Engineering Department, University of Kurdistan, Sanandaj, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, University of Kurdistan, Sanandaj, Iran","institution_ids":["https://openalex.org/I3124704065"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060047114","display_name":"Babak Yousefi Yegane","orcid":null},"institutions":[{"id":"https://openalex.org/I4210131670","display_name":"Islamic Azad University, Malayer Branch","ror":"https://ror.org/03f84d710","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210131670"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Babak Yousefi Yegane","raw_affiliation_strings":["Department of Industrial Engineering, Islamic Azad University, Malayer Branch, Malayer, Iran","Department of Industrial Engineering, Islamic Azad University, Malayer Branch, Malayer, Iran#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Islamic Azad University, Malayer Branch, Malayer, Iran","institution_ids":["https://openalex.org/I4210131670"]},{"raw_affiliation_string":"Department of Industrial Engineering, Islamic Azad University, Malayer Branch, Malayer, Iran#TAB#","institution_ids":["https://openalex.org/I4210131670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004428537","display_name":"Mohammad Fathian","orcid":"https://orcid.org/0000-0002-6909-6974"},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Fathian","raw_affiliation_strings":["Industrial Engineering Department, Iran University of Science and Technology, Narmak, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, Iran University of Science and Technology, Narmak, Tehran, Iran","institution_ids":["https://openalex.org/I67009956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037176755"],"corresponding_institution_ids":["https://openalex.org/I3124704065"],"apc_list":null,"apc_paid":null,"fwci":1.3884,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.84993816,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"89","issue":"3","first_page":"264","last_page":"277"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9965000152587891,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9940999746322632,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8651323318481445},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7229253053665161},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.6831734776496887},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.662017822265625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6433050036430359},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.5644229650497437},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5431811213493347},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.5092438459396362},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4357835650444031},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.431963711977005},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34503352642059326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2458052933216095},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.19138643145561218},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11176338791847229},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10738864541053772}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8651323318481445},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7229253053665161},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.6831734776496887},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.662017822265625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6433050036430359},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.5644229650497437},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5431811213493347},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.5092438459396362},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4357835650444031},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.431963711977005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34503352642059326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2458052933216095},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.19138643145561218},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11176338791847229},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10738864541053772},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"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.1177/0037549712459789","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0037549712459789","pdf_url":null,"source":{"id":"https://openalex.org/S32573412","display_name":"SIMULATION","issn_l":"0037-5497","issn":["0037-5497","1741-3133"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIMULATION","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W120831075","https://openalex.org/W159012016","https://openalex.org/W1588382077","https://openalex.org/W1964674593","https://openalex.org/W1967271207","https://openalex.org/W1998456004","https://openalex.org/W2000099188","https://openalex.org/W2008099858","https://openalex.org/W2013102873","https://openalex.org/W2015137401","https://openalex.org/W2020610603","https://openalex.org/W2027507691","https://openalex.org/W2030389264","https://openalex.org/W2039806905","https://openalex.org/W2046437335","https://openalex.org/W2074582930","https://openalex.org/W2076716919","https://openalex.org/W2085451512","https://openalex.org/W2087079928","https://openalex.org/W2122736695","https://openalex.org/W2125367223","https://openalex.org/W2155809154","https://openalex.org/W2166900052"],"related_works":["https://openalex.org/W1835156121","https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2146297781","https://openalex.org/W2612484291"],"abstract_inverted_index":{"The":[0,42,143],"flexible":[1,102],"job":[2,13,103],"shop":[3,14,104],"scheduling":[4,15,105],"problem":[5,16,83],"(FJSP)":[6],"is":[7,35,44,73,109,154],"an":[8,20,78],"extension":[9],"of":[10,32,53,56,136,146,156],"the":[11,60,65,69,113,125,134,140,158],"classical":[12],"(JSP)":[17],"which":[18],"allows":[19],"operation":[21,48],"to":[22,45,49,76,81,115,132],"be":[23],"processed":[24],"by":[25],"any":[26],"machine":[27,51],"from":[28],"a":[29,50,54,97,121,175],"given":[30],"set":[31,55],"machines.":[33,70],"FJSP":[34,114],"NP-hard":[36],"and":[37,59,86,138,148,165,170],"presents":[38],"two":[39],"major":[40],"difficulties.":[41],"first":[43],"assign":[46],"each":[47],"out":[52],"capable":[57,155],"machines;":[58],"second":[61],"deals":[62],"with":[63,90,106],"sequencing":[64],"assigned":[66],"operations":[67,108],"on":[68],"However,":[71],"it":[72],"quite":[74],"difficult":[75],"obtain":[77],"optimal":[79,159],"solution":[80,160],"this":[82,95],"in":[84,130,174],"medium":[85,169],"large":[87,171],"size":[88,163,172],"problems":[89,164,173],"traditional":[91],"optimization":[92],"approaches.":[93],"In":[94],"paper,":[96],"memetic":[98],"algorithm":[99],"(MA)":[100],"for":[101,161,168],"overlapping":[107],"proposed":[110,120],"that":[111,123,151],"solves":[112],"minimize":[116],"makespan.":[117],"We":[118],"also":[119],"heuristic":[122],"uses":[124],"critical":[126],"path":[127],"method":[128],"(CPM)":[129],"order":[131],"improve":[133],"results":[135,145],"MA":[137,147],"reduce":[139],"objective":[141],"function.":[142],"experimental":[144],"CPM":[149],"show":[150],"our":[152],"approach":[153],"achieving":[157],"small":[162],"near-optimal":[166],"solutions":[167],"reasonable":[176],"time.":[177]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}