{"id":"https://openalex.org/W4387123726","doi":"https://doi.org/10.1109/case56687.2023.10260378","title":"A Lower Bound Guided Hierarchical Approach for a Two-Stage Scheduling Problem","display_name":"A Lower Bound Guided Hierarchical Approach for a Two-Stage Scheduling Problem","publication_year":2023,"publication_date":"2023-08-26","ids":{"openalex":"https://openalex.org/W4387123726","doi":"https://doi.org/10.1109/case56687.2023.10260378"},"language":"en","primary_location":{"id":"doi:10.1109/case56687.2023.10260378","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/case56687.2023.10260378","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 19th International Conference on Automation Science and Engineering (CASE)","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/A5107678448","display_name":"Jiaxi Wu","orcid":"https://orcid.org/0000-0002-8989-7365"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiaxi Wu","raw_affiliation_strings":["Peking University,Department of Industrial Engineering & Management,China"],"affiliations":[{"raw_affiliation_string":"Peking University,Department of Industrial Engineering & Management,China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111274837","display_name":"Ye Liang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210130112","display_name":"China Academy of Information and Communications Technology","ror":"https://ror.org/038dte259","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210130112","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ye Liang","raw_affiliation_strings":["China Academy of Information and Communications Technology,China","China Academy of Information and Communications Technology, China"],"affiliations":[{"raw_affiliation_string":"China Academy of Information and Communications Technology,China","institution_ids":["https://openalex.org/I4210130112"]},{"raw_affiliation_string":"China Academy of Information and Communications Technology, China","institution_ids":["https://openalex.org/I4210130112"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101529205","display_name":"Leyuan Shi","orcid":"https://orcid.org/0000-0002-1397-2891"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leyuan Shi","raw_affiliation_strings":["University of Wisconsin-Madison,Department of Industrial & Systems Engineering,WI,USA,53706"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison,Department of Industrial & Systems Engineering,WI,USA,53706","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5107678448"],"corresponding_institution_ids":["https://openalex.org/I20231570"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21471667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"65","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":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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9993000030517578,"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.9958999752998352,"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/heuristics","display_name":"Heuristics","score":0.7791602611541748},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7272685766220093},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7154618501663208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6841279864311218},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.62103670835495},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6177342534065247},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4722033441066742},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4337006211280823},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42700302600860596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1970280110836029},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.07562017440795898}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7791602611541748},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7272685766220093},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7154618501663208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6841279864311218},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.62103670835495},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6177342534065247},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4722033441066742},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4337006211280823},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42700302600860596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1970280110836029},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.07562017440795898},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case56687.2023.10260378","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/case56687.2023.10260378","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 19th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1964701734","https://openalex.org/W1975572806","https://openalex.org/W2001905549","https://openalex.org/W2015385382","https://openalex.org/W2020107754","https://openalex.org/W2024085737","https://openalex.org/W2028653550","https://openalex.org/W2037808394","https://openalex.org/W2044336241","https://openalex.org/W2047305954","https://openalex.org/W2051370696","https://openalex.org/W2059573430","https://openalex.org/W2065186919","https://openalex.org/W2084278611","https://openalex.org/W2103547645","https://openalex.org/W2724486877","https://openalex.org/W2770866818","https://openalex.org/W2972440435","https://openalex.org/W3029416730"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W2041180560","https://openalex.org/W2011675579","https://openalex.org/W4285278887","https://openalex.org/W2365237642"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"a":[2,15,54,99],"challenging":[3],"and":[4,27,118],"common":[5],"production":[6],"scenario":[7],"in":[8,23,113],"the":[9,24,33,41,45,49,65,79,108],"discrete":[10],"manufacturing":[11],"industry,":[12],"we":[13,85],"study":[14],"two-stage":[16],"scheduling":[17],"problem":[18],"where":[19],"sub-components":[20],"are":[21],"processed":[22],"first":[25,52],"stage":[26],"then":[28],"grouped":[29],"together":[30],"to":[31,39,62,94],"complete":[32],"final":[34],"products.":[35],"Our":[36],"goal":[37],"is":[38,68],"minimize":[40],"completion":[42],"time":[43],"of":[44,70,82,102,115],"last":[46],"product,":[47],"i.e.,":[48],"makespan.":[50],"We":[51],"propose":[53],"novel":[55],"Mixed":[56],"Integer":[57],"Linear":[58],"Programming":[59],"(MILP)":[60],"model":[61],"formally":[63],"define":[64],"problem,":[66],"which":[67],"capable":[69],"finding":[71],"optimum":[72],"solutions":[73,97],"for":[74],"small-scale":[75],"problems.":[76],"To":[77],"tackle":[78],"practical":[80],"challenge":[81],"large-scale":[83],"problems,":[84],"design":[86],"an":[87],"efficient":[88],"lower-bound":[89],"guided":[90],"hierarchical":[91],"heuristic":[92],"(LBGH)":[93],"produce":[95],"high-quality":[96],"within":[98],"reasonable":[100],"amount":[101],"time.":[103],"Numerical":[104],"experiments":[105],"demonstrate":[106],"that":[107],"LBGH":[109],"outperforms":[110],"state-of-the-art":[111],"meta-heuristics":[112],"terms":[114],"solution":[116],"quality":[117],"computational":[119],"efficiency.":[120]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}