{"id":"https://openalex.org/W4315783549","doi":"https://doi.org/10.1109/icnsc55942.2022.10004154","title":"Constraint Programming for Modeling and Solving a Hybrid Flow Shop Scheduling Problem","display_name":"Constraint Programming for Modeling and Solving a Hybrid Flow Shop Scheduling Problem","publication_year":2022,"publication_date":"2022-12-15","ids":{"openalex":"https://openalex.org/W4315783549","doi":"https://doi.org/10.1109/icnsc55942.2022.10004154"},"language":"en","primary_location":{"id":"doi:10.1109/icnsc55942.2022.10004154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc55942.2022.10004154","pdf_url":null,"source":{"id":"https://openalex.org/S4363608241","display_name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","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/A5100392971","display_name":"Haotian Zhang","orcid":"https://orcid.org/0009-0005-6082-7389"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Haotian Zhang","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University,Shenyang,China,110819"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University,Shenyang,China,110819","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049742708","display_name":"Yingjun Ji","orcid":"https://orcid.org/0000-0001-9988-3314"},"institutions":[{"id":"https://openalex.org/I118803816","display_name":"Liaoning University","ror":"https://ror.org/03xpwj629","country_code":"CN","type":"education","lineage":["https://openalex.org/I118803816"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yingjun Ji","raw_affiliation_strings":["College of Information, Liaoning University,Shenyang,China,110036"],"affiliations":[{"raw_affiliation_string":"College of Information, Liaoning University,Shenyang,China,110036","institution_ids":["https://openalex.org/I118803816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034030541","display_name":"Ziyan Zhao","orcid":"https://orcid.org/0000-0002-6667-6308"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]},{"id":"https://openalex.org/I14894300","display_name":"Foshan University","ror":"https://ror.org/02xvvvp28","country_code":"CN","type":"education","lineage":["https://openalex.org/I14894300"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ziyan Zhao","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University,Shenyang,China,110819","Foshan Graduate School of Innovation, Northeastern University, Foshan, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University,Shenyang,China,110819","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"Foshan Graduate School of Innovation, Northeastern University, Foshan, China","institution_ids":["https://openalex.org/I14894300","https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101517221","display_name":"Shixin Liu","orcid":"https://orcid.org/0000-0002-3404-9297"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shixin Liu","raw_affiliation_strings":["College of Information Science and Engineering, Northeastern University,Shenyang,China,110819"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Northeastern University,Shenyang,China,110819","institution_ids":["https://openalex.org/I9224756"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100392971"],"corresponding_institution_ids":["https://openalex.org/I9224756"],"apc_list":null,"apc_paid":null,"fwci":0.6935,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64777048,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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.9959999918937683,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.8237282633781433},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7831400036811829},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7307468056678772},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6599228382110596},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5833533406257629},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5694921016693115},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49458619952201843},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4927201569080353},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.18501988053321838},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12297934293746948},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.08233144879341125}],"concepts":[{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.8237282633781433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7831400036811829},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7307468056678772},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6599228382110596},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5833533406257629},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5694921016693115},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49458619952201843},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4927201569080353},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.18501988053321838},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12297934293746948},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08233144879341125},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnsc55942.2022.10004154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc55942.2022.10004154","pdf_url":null,"source":{"id":"https://openalex.org/S4363608241","display_name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.47999998927116394}],"awards":[{"id":"https://openalex.org/G1538510422","display_name":null,"funder_award_id":"N2204016","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"},{"id":"https://openalex.org/G8755973259","display_name":null,"funder_award_id":"62073069,62203093","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1970927811","https://openalex.org/W1996580751","https://openalex.org/W2046283054","https://openalex.org/W2056772503","https://openalex.org/W2094182767","https://openalex.org/W2153895727","https://openalex.org/W2170006013","https://openalex.org/W2790098940","https://openalex.org/W2811008753","https://openalex.org/W2951537749","https://openalex.org/W2953727643","https://openalex.org/W2954364835","https://openalex.org/W2998573575","https://openalex.org/W2999708372","https://openalex.org/W3022502563","https://openalex.org/W3094288436","https://openalex.org/W3102115455","https://openalex.org/W3115742705","https://openalex.org/W3137007432","https://openalex.org/W3208702183","https://openalex.org/W4200305979","https://openalex.org/W4205286934"],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2069961172","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W3155166764"],"abstract_inverted_index":{"As":[0],"an":[1,114],"extension":[2],"of":[3,94],"a":[4,37,109,118,123],"flow":[5,10,39],"shop":[6,11,40],"scheduling":[7,12],"problem,":[8],"hybrid":[9],"problems":[13],"(HFSP)":[14],"have":[15],"been":[16],"widely":[17],"concerned.":[18],"Their":[19],"characteristics":[20],"are":[21],"that":[22,101],"every":[23,29],"stage":[24],"has":[25,31],"parallel":[26],"machines,":[27],"and":[28,62,117],"job":[30],"more":[32],"complicated":[33],"production":[34],"routes":[35],"than":[36],"classical":[38],"problem.":[41],"Currently,":[42],"most":[43],"research":[44],"about":[45],"HFSP":[46],"is":[47],"based":[48,65],"on":[49,66,75],"meta-heuristic":[50],"algorithms,":[51],"especially":[52],"evolutionary":[53],"algorithms.":[54],"In":[55],"this":[56],"article,":[57],"we":[58],"provide":[59,108],"new":[60],"models":[61],"solution":[63,87,112,121],"methods":[64],"constraint":[67],"programming":[68],"(CP).":[69],"According":[70],"to":[71],"our":[72],"experiments":[73],"conducted":[74],"benchmark":[76,96],"datasets,":[77],"CP":[78],"shows":[79],"great":[80],"performance":[81],"in":[82],"comparison":[83],"with":[84],"other":[85],"competitive":[86],"methods.":[88],"It":[89],"renews":[90],"the":[91,99],"best-found":[92],"solutions":[93],"some":[95],"instances.":[97],"For":[98],"instances":[100],"cannot":[102],"be":[103],"solved":[104],"exactly,":[105],"it":[106],"can":[107],"high-accuracy":[110],"feasible":[111],"as":[113,122],"upper":[115],"bound":[116],"relaxed":[119],"infeasible":[120],"lower":[124],"bound.":[125]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}