{"id":"https://openalex.org/W2012443388","doi":"https://doi.org/10.1109/grc.2009.5255027","title":"A two-step approach for solving the flexible job shop scheduling problem","display_name":"A two-step approach for solving the flexible job shop scheduling problem","publication_year":2009,"publication_date":"2009-08-01","ids":{"openalex":"https://openalex.org/W2012443388","doi":"https://doi.org/10.1109/grc.2009.5255027","mag":"2012443388"},"language":"en","primary_location":{"id":"doi:10.1109/grc.2009.5255027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grc.2009.5255027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Granular Computing","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/A5101402436","display_name":"Aihua Yin","orcid":"https://orcid.org/0000-0001-5559-1555"},"institutions":[{"id":"https://openalex.org/I59649739","display_name":"Jiangxi University of Finance and Economics","ror":"https://ror.org/03efmyj29","country_code":"CN","type":"education","lineage":["https://openalex.org/I59649739"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ai-Hua Yin","raw_affiliation_strings":["UFIDA software school, Jiangxi University of Finance and Economics, Nanchang, Jiangxi, China","UFIDA software school of Jiangxi University of Finance and Economics, Nanchang, 330013, China"],"affiliations":[{"raw_affiliation_string":"UFIDA software school, Jiangxi University of Finance and Economics, Nanchang, Jiangxi, China","institution_ids":["https://openalex.org/I59649739"]},{"raw_affiliation_string":"UFIDA software school of Jiangxi University of Finance and Economics, Nanchang, 330013, China","institution_ids":["https://openalex.org/I59649739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040914101","display_name":"Xiaoping Zhao","orcid":"https://orcid.org/0000-0001-7179-220X"},"institutions":[{"id":"https://openalex.org/I59649739","display_name":"Jiangxi University of Finance and Economics","ror":"https://ror.org/03efmyj29","country_code":"CN","type":"education","lineage":["https://openalex.org/I59649739"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiao-Ping Zhao","raw_affiliation_strings":["UFIDA software school, Jiangxi University of Finance and Economics, Nanchang, Jiangxi, China","UFIDA software school of Jiangxi University of Finance and Economics, Nanchang, 330013, China"],"affiliations":[{"raw_affiliation_string":"UFIDA software school, Jiangxi University of Finance and Economics, Nanchang, Jiangxi, China","institution_ids":["https://openalex.org/I59649739"]},{"raw_affiliation_string":"UFIDA software school of Jiangxi University of Finance and Economics, Nanchang, 330013, China","institution_ids":["https://openalex.org/I59649739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101402436"],"corresponding_institution_ids":["https://openalex.org/I59649739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14381122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2007","issue":null,"first_page":"716","last_page":"720"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9957000017166138,"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.7413669228553772},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6836202144622803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6831908226013184},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6340876221656799},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.581865131855011},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5764949321746826},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5483874678611755},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5220482349395752},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5117473602294922},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.45993590354919434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17991074919700623},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08067187666893005}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7413669228553772},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6836202144622803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6831908226013184},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6340876221656799},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.581865131855011},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5764949321746826},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5483874678611755},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5220482349395752},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5117473602294922},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.45993590354919434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17991074919700623},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08067187666893005},{"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.1109/grc.2009.5255027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grc.2009.5255027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Granular Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1966217755","https://openalex.org/W2017776520","https://openalex.org/W2152665062","https://openalex.org/W2166900052","https://openalex.org/W2353596354","https://openalex.org/W2355617694","https://openalex.org/W2392131459"],"related_works":["https://openalex.org/W2106332846","https://openalex.org/W2545511463","https://openalex.org/W2245286458","https://openalex.org/W2956094179","https://openalex.org/W2949165180","https://openalex.org/W2155809154","https://openalex.org/W2172075652","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W27741389"],"abstract_inverted_index":{"The":[0,102],"flexible":[1],"job":[2,56,74,114],"shop":[3,57,75],"scheduling":[4,13,58,76,115],"problem":[5,53],"is":[6,43,69,80,95,107],"one":[7],"of":[8],"the":[9,28,32,37,52,55,61,73,87,113,140],"most":[10],"difficult":[11],"production":[12],"problems":[14],"in":[15],"industry.":[16],"This":[17],"paper":[18],"presents":[19],"a":[20,46,64,108,121],"two-step":[21,93],"approach":[22,79,94],"to":[23,36,71],"solve":[24,72],"this":[25,92],"problem.":[26,59,77,141],"In":[27,60],"first":[29],"step,":[30,63],"all":[31],"operations":[33],"are":[34],"disputed":[35],"machines":[38],"such":[39],"that":[40,51,91],"each":[41],"operation":[42],"processed":[44],"by":[45,133],"certain":[47],"machine":[48],"which":[49],"means":[50],"becomes":[54],"second":[62],"quasi-physic":[65,103],"and":[66,86,98,104,117,129],"quasi-human":[67,105],"algorithm":[68,106,132],"proposed":[70],"Our":[78],"tested":[81],"on":[82],"several":[83],"common":[84],"benchmarks,":[85],"computational":[88],"experiments":[89],"show":[90],"quite":[96],"effective":[97,128],"efficient.":[99],"Further":[100],"more,":[101],"new":[109],"idea":[110],"for":[111,126,139],"solving":[112],"problem,":[116],"it":[118],"could":[119],"be":[120],"very":[122],"good":[123],"basic":[124],"procedure":[125],"designing":[127],"efficient":[130],"heuristic":[131,137],"combining":[134],"with":[135],"other":[136],"strategy":[138]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}