{"id":"https://openalex.org/W2889238960","doi":"https://doi.org/10.1109/tase.2018.2859741","title":"Throughput Maximization of Capacitated Re-Entrant Lines Through Fluid Relaxation","display_name":"Throughput Maximization of Capacitated Re-Entrant Lines Through Fluid Relaxation","publication_year":2018,"publication_date":"2018-08-29","ids":{"openalex":"https://openalex.org/W2889238960","doi":"https://doi.org/10.1109/tase.2018.2859741","mag":"2889238960"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2018.2859741","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2018.2859741","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","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/A5009611474","display_name":"Michael Ibrahim","orcid":"https://orcid.org/0000-0003-2340-8917"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Ibrahim","raw_affiliation_strings":["School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":"https://orcid.org/0000-0003-2340-8917","affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008675858","display_name":"Spyros Reveliotis","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Spyros Reveliotis","raw_affiliation_strings":["School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":"https://orcid.org/0000-0001-6176-0925","affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7671,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87645921,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"16","issue":"2","first_page":"792","last_page":"810"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9941999912261963,"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.9941999912261963,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9779000282287598,"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"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9771000146865845,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7064632177352905},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6575474739074707},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6311328411102295},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6196194291114807},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.6016543507575989},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5461292862892151},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5438829064369202},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5243492722511292},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5219696760177612},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.47846150398254395},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.46746304631233215},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.45145851373672485},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.41375333070755005},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.3861258029937744},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.15134268999099731},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13753163814544678},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13078057765960693}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7064632177352905},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6575474739074707},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6311328411102295},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6196194291114807},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.6016543507575989},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5461292862892151},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5438829064369202},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5243492722511292},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5219696760177612},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.47846150398254395},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.46746304631233215},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.45145851373672485},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.41375333070755005},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.3861258029937744},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.15134268999099731},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13753163814544678},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13078057765960693},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2018.2859741","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2018.2859741","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.47999998927116394,"display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G1667598546","display_name":null,"funder_award_id":"ECCS-1707695","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3399808733","display_name":null,"funder_award_id":"ECCS-1405156","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W121729964","https://openalex.org/W166558324","https://openalex.org/W565357261","https://openalex.org/W1483186571","https://openalex.org/W1487626875","https://openalex.org/W1496620875","https://openalex.org/W1499021337","https://openalex.org/W1555220825","https://openalex.org/W1591102903","https://openalex.org/W1669394296","https://openalex.org/W1973403707","https://openalex.org/W1986755980","https://openalex.org/W2021737336","https://openalex.org/W2066077117","https://openalex.org/W2082791325","https://openalex.org/W2090134545","https://openalex.org/W2098432798","https://openalex.org/W2103098926","https://openalex.org/W2108710283","https://openalex.org/W2110235415","https://openalex.org/W2115252758","https://openalex.org/W2126083742","https://openalex.org/W2134666018","https://openalex.org/W2151208868","https://openalex.org/W2151407682","https://openalex.org/W2155529449","https://openalex.org/W2165837246","https://openalex.org/W2334782222","https://openalex.org/W2400458653","https://openalex.org/W2489145936","https://openalex.org/W2509841691","https://openalex.org/W2605051396","https://openalex.org/W2612300704","https://openalex.org/W4214611073","https://openalex.org/W4252684946","https://openalex.org/W6605012485","https://openalex.org/W6606808564","https://openalex.org/W6737372687","https://openalex.org/W6841587223"],"related_works":["https://openalex.org/W2165837246","https://openalex.org/W2740248532","https://openalex.org/W1761653681","https://openalex.org/W2240441253","https://openalex.org/W2574765811","https://openalex.org/W2102433499","https://openalex.org/W2692080773","https://openalex.org/W312649961","https://openalex.org/W2001526624","https://openalex.org/W1890235978","https://openalex.org/W3161959338","https://openalex.org/W2043345276","https://openalex.org/W2040877664","https://openalex.org/W164630100","https://openalex.org/W2168322639","https://openalex.org/W1982061997","https://openalex.org/W2330113505","https://openalex.org/W3023601212","https://openalex.org/W1569557942","https://openalex.org/W2335066170"],"abstract_inverted_index":{"This":[0],"paper":[1,79],"extends":[2],"the":[3,14,26,45,51,78,89,98,103,115,119,128,138,145,152,158,175,178,187,190,199,214,226,229],"scheduling":[4,28,160,179,193,205],"methodology":[5],"for":[6,93,122,144,169,207],"complex":[7],"stochastic":[8,31],"networks":[9,32],"that":[10,130,148,167,210],"is":[11,162],"based":[12],"on":[13,114],"solution":[15],"of":[16,25,54,111,137,157,172,177,189,201,221,228],"a":[17,39,55,75,84,109,170],"\u201cfluid\u201d":[18],"relaxation":[19],"(FR)":[20],"at":[21,63],"each":[22,64],"decision":[23],"point":[24],"original":[27],"problem":[29],"to":[30,87,101,185,197,235],"with":[33,59],"blocking":[34,146],"and":[35,41,96,195,224],"deadlocking":[36],"effects.":[37],"For":[38],"clearer":[40],"more":[42],"concrete":[43],"treatment,":[44],"presented":[46,159,230],"results":[47,80],"are":[48,68,81,211],"developed":[49],"in":[50,134,151],"operational":[52],"context":[53],"re-entrant":[56],"line":[57],"(RL)":[58],"finite":[60],"buffering":[61],"capacity":[62],"workstation;":[65],"these":[66,208],"RLs":[67,72],"characterized":[69],"as":[70,108],"\u201ccapacitated":[71],"(CRLs).\u201d":[73],"From":[74],"methodological":[76],"standpoint,":[77],"enabled":[82],"by":[83,97,232],"pre-established":[85],"ability":[86,100],"control":[88],"underlying":[90],"resource":[91],"allocation":[92],"deadlock":[94,105],"freedom":[95],"further":[99],"express":[102],"corresponding":[104,191],"avoidance":[106],"policy":[107],"set":[110,171,220],"linear":[112],"inequalities":[113],"system":[116,239],"state.":[117],"Also,":[118],"employed":[120,133],"FR":[121],"this":[123,183],"new":[124],"regime":[125],"differs":[126],"from":[127,213],"FRs":[129],"have":[131],"been":[132],"past":[135],"implementations":[136],"method":[139,161,184,231],"since":[140],"it":[141,234],"must":[142],"account":[143],"effects":[147],"take":[149],"place":[150],"considered":[153],"CRLs.":[154],"The":[155],"efficacy":[156],"assessed":[163],"through":[164,182],"numerical":[165],"experimentation":[166],"compares,":[168],"\u201cbenchmark\u201d":[173],"CRLs,":[174],"performance":[176,188,200],"policies":[180,194,206],"obtained":[181],"1)":[186],"optimal":[192],"also":[196],"2)":[198],"some":[202,236],"other":[203],"heuristic":[204],"systems":[209],"adapted":[212],"relevant":[215],"literature.":[216],"Finally,":[217],"an":[218],"additional":[219],"experiments":[222],"demonstrates":[223],"assesses":[225],"scalability":[227],"applying":[233],"pretty":[237],"large":[238],"configurations.":[240]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}