{"id":"https://openalex.org/W4297052476","doi":"https://doi.org/10.1080/00207543.2022.2119294","title":"Batching and scheduling in a continuous-discrete hybrid flowshop: Lagrangian relaxation-based heuristic algorithms","display_name":"Batching and scheduling in a continuous-discrete hybrid flowshop: Lagrangian relaxation-based heuristic algorithms","publication_year":2022,"publication_date":"2022-09-15","ids":{"openalex":"https://openalex.org/W4297052476","doi":"https://doi.org/10.1080/00207543.2022.2119294"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2022.2119294","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2022.2119294","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","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/A5100376705","display_name":"Zhaohui Li","orcid":"https://orcid.org/0000-0002-3237-2912"},"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":"Zhaohui Li","raw_affiliation_strings":["Data-Driven Management Decision Making Lab, Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai, People's Republic of China"],"affiliations":[{"raw_affiliation_string":"Data-Driven Management Decision Making Lab, Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai, People's Republic of China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014113229","display_name":"Guohua Wan","orcid":"https://orcid.org/0000-0002-9298-1023"},"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":true,"raw_author_name":"Guohua Wan","raw_affiliation_strings":["Data-Driven Management Decision Making Lab, Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai, People's Republic of China"],"affiliations":[{"raw_affiliation_string":"Data-Driven Management Decision Making Lab, Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai, People's Republic of China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014113229"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":2.1337,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88288739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"61","issue":"17","first_page":"5934","last_page":"5955"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9947999715805054,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.744508683681488},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7171056866645813},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6300827264785767},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5852333307266235},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5724202990531921},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.54316645860672},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5414798855781555},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5404660701751709},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5177797079086304},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45267486572265625},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.41722536087036133},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3000515103340149},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10585057735443115}],"concepts":[{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.744508683681488},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7171056866645813},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6300827264785767},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5852333307266235},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5724202990531921},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.54316645860672},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5414798855781555},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5404660701751709},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5177797079086304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45267486572265625},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.41722536087036133},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3000515103340149},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10585057735443115},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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":2,"locations":[{"id":"doi:10.1080/00207543.2022.2119294","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2022.2119294","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:61:y:2023:i:17:p:5934-5955","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2022.2119294","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.5400000214576721,"display_name":"Industry, innovation and infrastructure"}],"awards":[{"id":"https://openalex.org/G3814754871","display_name":null,"funder_award_id":"71931008,71520107003Program of Shanghai Subject Chief Scientist, Grant/ Award Number: 16XD1401700","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1573837192","https://openalex.org/W1966523365","https://openalex.org/W1990514741","https://openalex.org/W1994024252","https://openalex.org/W1998362379","https://openalex.org/W1999035181","https://openalex.org/W2003813161","https://openalex.org/W2007255736","https://openalex.org/W2012586594","https://openalex.org/W2028945030","https://openalex.org/W2048631059","https://openalex.org/W2060749288","https://openalex.org/W2063338724","https://openalex.org/W2064313537","https://openalex.org/W2068317441","https://openalex.org/W2074055219","https://openalex.org/W2087583935","https://openalex.org/W2092068825","https://openalex.org/W2092220973","https://openalex.org/W2096118674","https://openalex.org/W2114338779","https://openalex.org/W2116152588","https://openalex.org/W2117782865","https://openalex.org/W2119606476","https://openalex.org/W2129359183","https://openalex.org/W2158023072","https://openalex.org/W2479867382","https://openalex.org/W2743045177","https://openalex.org/W2746545441","https://openalex.org/W2765500743","https://openalex.org/W2913055783","https://openalex.org/W3011585646","https://openalex.org/W3013861866","https://openalex.org/W3015562383","https://openalex.org/W3036353542","https://openalex.org/W3103877605","https://openalex.org/W3126154022","https://openalex.org/W3127727712","https://openalex.org/W3173369534","https://openalex.org/W3175546025","https://openalex.org/W3194038341","https://openalex.org/W4254424307"],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W4252122881","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"],"abstract_inverted_index":{"We":[0,65,113],"study":[1],"a":[2,10,20,30,70,77,99],"two-stage":[3],"hybrid":[4],"flow":[5],"shop":[6],"problem":[7,68,87],"arising":[8],"from":[9],"fine":[11],"chemicals":[12],"production":[13],"facility,":[14],"where":[15,84],"the":[16,26,39,47,52,60,67,85,144,147,154],"first":[17,55],"stage":[18,28,56],"is":[19,29,36,88,96],"continuous":[21],"chemical":[22],"reaction":[23],"process":[24],"and":[25,49,57,75,93,110,138,151],"second":[27,63],"discrete":[31],"filling-packaging":[32],"process.":[33],"The":[34,102],"objective":[35],"to":[37,106,142],"minimise":[38],"total":[40],"weighted":[41],"completion":[42],"time":[43],"through":[44],"batching":[45],"of":[46,51,59,126,146],"jobs":[48,61],"scheduling":[50,58],"batches":[53],"at":[54,62],"stage.":[64],"formulate":[66],"as":[69],"mixed":[71],"integer":[72],"programming":[73],"model":[74],"develop":[76],"Lagrangian":[78],"relaxation-based":[79],"framework":[80],"for":[81,119],"solving":[82],"it,":[83],"original":[86],"decomposed":[89],"into":[90,98],"family-level":[91],"subproblems,":[92],"each":[94],"subproblem":[95],"transformed":[97],"set-partitioning":[100],"problem.":[101],"subproblems":[103],"are":[104],"solved":[105],"optimality":[107],"via":[108],"branch":[109],"price":[111],"algorithm.":[112],"also":[114],"propose":[115],"two":[116],"heuristic":[117],"algorithms":[118,150,155],"reducing":[120],"computational":[121,132],"efforts":[122],"without":[123],"much":[124],"loss":[125],"solution":[127],"quality.":[128],"Finally,":[129],"we":[130],"conduct":[131],"experiments":[133],"with":[134],"both":[135],"randomly":[136],"generated":[137],"real":[139],"data":[140],"sets":[141],"test":[143],"performance":[145],"three":[148],"proposed":[149],"demonstrate":[152],"that":[153],"perform":[156],"efficiently.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}