{"id":"https://openalex.org/W3083592248","doi":"https://doi.org/10.1109/cec48606.2020.9185763","title":"Simultaneous Scheduling Strategy: A Novel Method for Flexible Job Shop Scheduling Problem","display_name":"Simultaneous Scheduling Strategy: A Novel Method for Flexible Job Shop Scheduling Problem","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3083592248","doi":"https://doi.org/10.1109/cec48606.2020.9185763","mag":"3083592248"},"language":"en","primary_location":{"id":"doi:10.1109/cec48606.2020.9185763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec48606.2020.9185763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-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/A5100461675","display_name":"Bo Liu","orcid":"https://orcid.org/0000-0002-6615-6601"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bo Liu","raw_affiliation_strings":["Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101875332","display_name":"Siqi Qiu","orcid":"https://orcid.org/0000-0002-0387-1691"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Siqi Qiu","raw_affiliation_strings":["Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101595187","display_name":"Ming Li","orcid":"https://orcid.org/0000-0003-4527-4542"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ming Li","raw_affiliation_strings":["Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3616,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68864283,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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.9922999739646912,"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/T12288","display_name":"Optimization and Search Problems","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.7397370338439941},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.7094157934188843},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6970865726470947},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.6790288686752319},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6765910983085632},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6631271839141846},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5717549324035645},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5221241116523743},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5124433636665344},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.49976372718811035},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.46605169773101807},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.45788896083831787},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4435533583164215},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43629199266433716},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.42397430539131165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18626731634140015},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.13273122906684875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1024962067604065},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07125911116600037}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7397370338439941},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.7094157934188843},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6970865726470947},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.6790288686752319},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6765910983085632},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6631271839141846},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5717549324035645},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5221241116523743},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5124433636665344},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.49976372718811035},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.46605169773101807},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.45788896083831787},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4435533583164215},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43629199266433716},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.42397430539131165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18626731634140015},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.13273122906684875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1024962067604065},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07125911116600037}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec48606.2020.9185763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec48606.2020.9185763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE Congress on Evolutionary Computation (CEC)","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.7200000286102295}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1967913613","https://openalex.org/W1970176495","https://openalex.org/W1987781906","https://openalex.org/W2046437335","https://openalex.org/W2064661781","https://openalex.org/W2080983155","https://openalex.org/W2135752285","https://openalex.org/W2137333349","https://openalex.org/W2144821292","https://openalex.org/W2154683106","https://openalex.org/W2260286117","https://openalex.org/W2801016318","https://openalex.org/W2941722570","https://openalex.org/W2951307174"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W2076947091","https://openalex.org/W2167574351","https://openalex.org/W2257422103","https://openalex.org/W2007437247","https://openalex.org/W2557471897","https://openalex.org/W2172075652","https://openalex.org/W2225350526"],"abstract_inverted_index":{"This":[0],"paper":[1],"discussed":[2],"the":[3,48,53,59,71,75],"contradictory":[4],"between":[5],"wait":[6],"time":[7,46],"for":[8],"computation":[9],"and":[10,47,89,103],"solution":[11,40,49],"quality":[12],"in":[13,43],"solving":[14],"flexible":[15],"job":[16],"shop":[17],"scheduling":[18,28,91,100],"problems.":[19],"In":[20],"order":[21],"to":[22,63],"reconcile":[23],"this":[24],"contradictory,":[25],"a":[26,37,44],"novel":[27],"strategy":[29],"called":[30],"Simultaneous":[31],"Scheduling":[32],"is":[33,41,50,78,101],"proposed.":[34],"At":[35],"first,":[36],"fairly":[38],"good":[39],"obtained":[42],"short":[45],"set":[51],"as":[52,65,67],"temporary":[54,76],"processing":[55],"plan":[56,77],"so":[57],"that":[58,98],"machines":[60,72],"can":[61],"start":[62],"work":[64],"soon":[66],"possible.":[68],"Then":[69],"while":[70],"are":[73,93],"running,":[74],"being":[79],"improved":[80],"with":[81],"evolutionary":[82],"algorithms":[83],"continuously.":[84],"Experiments":[85],"on":[86],"both":[87],"static":[88],"dynamic":[90],"problems":[92],"performed.":[94],"The":[95],"results":[96],"show":[97],"simultaneous":[99],"effective":[102],"efficient.":[104]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}