{"id":"https://openalex.org/W2554758994","doi":"https://doi.org/10.1109/coase.2016.7743432","title":"Two-stage flow shop with a batch processor and limited buffer","display_name":"Two-stage flow shop with a batch processor and limited buffer","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2554758994","doi":"https://doi.org/10.1109/coase.2016.7743432","mag":"2554758994"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2016.7743432","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2016.7743432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5070777072","display_name":"Zhongshun Shi","orcid":"https://orcid.org/0000-0003-3719-7321"},"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":false,"raw_author_name":"Zhongshun Shi","raw_affiliation_strings":["Department of Industrial Engineering & Management, Peking University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering & Management, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008575214","display_name":"Zewen Huang","orcid":null},"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":false,"raw_author_name":"Zewen Huang","raw_affiliation_strings":["Department of Industrial Engineering & Management, Peking University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering & Management, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]},{"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/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Leyuan Shi","raw_affiliation_strings":["Department of Industrial Engineering & Management, Peking University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering & Management, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20231570"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"395","last_page":"400"},"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.9965999722480774,"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.9961000084877014,"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/computer-science","display_name":"Computer science","score":0.7684860229492188},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.639851450920105},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5872046947479248},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.564176082611084},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5510650873184204},{"id":"https://openalex.org/keywords/buffer","display_name":"Buffer (optical fiber)","score":0.5253148078918457},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5171543955802917},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4560319483280182},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.4513680636882782},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4238704442977905},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.41203126311302185},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35698240995407104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22618919610977173},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.15341001749038696},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.14167559146881104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13671404123306274}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7684860229492188},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.639851450920105},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5872046947479248},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.564176082611084},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5510650873184204},{"id":"https://openalex.org/C145018004","wikidata":"https://www.wikidata.org/wiki/Q4985944","display_name":"Buffer (optical fiber)","level":2,"score":0.5253148078918457},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5171543955802917},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4560319483280182},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.4513680636882782},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4238704442977905},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.41203126311302185},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35698240995407104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22618919610977173},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.15341001749038696},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.14167559146881104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13671404123306274},{"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/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2016.7743432","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2016.7743432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Automation Science and Engineering (CASE)","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.6700000166893005}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1965643790","https://openalex.org/W1966303191","https://openalex.org/W1971258248","https://openalex.org/W1990190564","https://openalex.org/W1996628037","https://openalex.org/W2015329117","https://openalex.org/W2043969032","https://openalex.org/W2074693286","https://openalex.org/W2083184631","https://openalex.org/W2092068825","https://openalex.org/W2126707169","https://openalex.org/W2133826558"],"related_works":["https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2386897521","https://openalex.org/W2069961172","https://openalex.org/W26892725"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"a":[3,10,15,43,54,66,98],"two-stage":[4],"flow":[5],"shop":[6],"scheduling":[7],"problem":[8],"with":[9,83],"batch":[11,35],"processor":[12,36],"followed":[13],"by":[14],"discrete":[16],"processor.":[17],"Jobs":[18],"are":[19],"grouped":[20],"in":[21,46],"incompatible":[22],"job":[23],"families,":[24],"and":[25,72],"the":[26,29,47,58,84,94,102],"buffer":[27],"between":[28],"two":[30,73],"machines":[31],"is":[32,42,51,62,87],"limited.":[33],"The":[34,49],"will":[37],"be":[38],"blocked":[39],"until":[40],"there":[41],"free":[44],"unit":[45],"buffer.":[48],"objective":[50],"to":[52],"determine":[53],"schedule":[55],"such":[56],"that":[57,93],"total":[59],"completion":[60],"time":[61],"minimized.":[63],"We":[64],"propose":[65],"mixed":[67],"integer":[68],"linear":[69],"programming":[70],"model":[71],"lower":[74],"bounds":[75],"for":[76],"this":[77],"problem.":[78],"A":[79],"hybrid":[80],"algorithm":[81,96],"together":[82],"worst-case":[85],"analyses":[86],"also":[88],"developed.":[89],"Numerical":[90],"results":[91],"demonstrate":[92],"proposed":[95],"has":[97],"competitive":[99],"performance":[100],"on":[101],"large-scale":[103],"problems.":[104]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}