{"id":"https://openalex.org/W2111891101","doi":"https://doi.org/10.1109/cdc.2004.1429306","title":"Relative value function approximation for the capacitated re-entrant line scheduling problem: an experimental investigation","display_name":"Relative value function approximation for the capacitated re-entrant line scheduling problem: an experimental investigation","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2111891101","doi":"https://doi.org/10.1109/cdc.2004.1429306","mag":"2111891101"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2004.1429306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2004.1429306","pdf_url":null,"source":{"id":"https://openalex.org/S4363608267","display_name":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","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":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","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/A5030380431","display_name":"Jin\u2010Young Choi","orcid":"https://orcid.org/0000-0002-8100-7583"},"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":"J.Y. Choi","raw_affiliation_strings":["School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., 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":"S. Reveliotis","raw_affiliation_strings":["School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering, Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3661","last_page":"3667 Vol.4"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9984999895095825,"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.9983000159263611,"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/correctness","display_name":"Correctness","score":0.8353176116943359},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7389769554138184},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.681380033493042},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5655131340026855},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.5413944125175476},{"id":"https://openalex.org/keywords/workstation","display_name":"Workstation","score":0.5082394480705261},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.4823445677757263},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4632505178451538},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.43687447905540466},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4276329278945923},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4253571927547455},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3648653030395508},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22038981318473816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15651726722717285},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.13929903507232666}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8353176116943359},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7389769554138184},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.681380033493042},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5655131340026855},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.5413944125175476},{"id":"https://openalex.org/C67953723","wikidata":"https://www.wikidata.org/wiki/Q192525","display_name":"Workstation","level":2,"score":0.5082394480705261},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.4823445677757263},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4632505178451538},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.43687447905540466},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4276329278945923},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4253571927547455},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3648653030395508},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22038981318473816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15651726722717285},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.13929903507232666},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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":1,"locations":[{"id":"doi:10.1109/cdc.2004.1429306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2004.1429306","pdf_url":null,"source":{"id":"https://openalex.org/S4363608267","display_name":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","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":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.550000011920929,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W9069871","https://openalex.org/W121729964","https://openalex.org/W1512407760","https://openalex.org/W1555220825","https://openalex.org/W1576452626","https://openalex.org/W1973022038","https://openalex.org/W2003256546","https://openalex.org/W2013501221","https://openalex.org/W2040766536","https://openalex.org/W2097984481","https://openalex.org/W2104335146","https://openalex.org/W2110656341","https://openalex.org/W2115252758","https://openalex.org/W2119567691","https://openalex.org/W2126083742","https://openalex.org/W2133822450","https://openalex.org/W2151407682","https://openalex.org/W2164239387","https://openalex.org/W2168739325","https://openalex.org/W2169982856","https://openalex.org/W2334782222","https://openalex.org/W2400458653","https://openalex.org/W4229683464"],"related_works":["https://openalex.org/W4255265352","https://openalex.org/W4239477580","https://openalex.org/W4285537323","https://openalex.org/W1932159282","https://openalex.org/W2090698372","https://openalex.org/W4383890581","https://openalex.org/W2965004901","https://openalex.org/W2921905705","https://openalex.org/W4233178034","https://openalex.org/W2003293420"],"abstract_inverted_index":{"The":[0,76],"problem":[1],"addressed":[2],"in":[3,19,31],"this":[4],"work":[5],"is":[6,59,65,70],"that":[7,58,80],"of":[8,43],"determining":[9],"how":[10],"to":[11,24,33,94],"allocate":[12],"the":[13,25,40,44,55,81,95],"workstation":[14],"processing":[15],"and":[16,67,97],"buffering":[17],"capacity":[18],"a":[20,73,89],"capacitated":[21],"re-entrant":[22],"line":[23],"job":[26],"instances":[27],"competing":[28],"for":[29,54,87,100],"it,":[30],"order":[32],"maximize":[34],"its":[35,68],"longrun/steady-state":[36],"throughput,":[37],"while":[38],"maintaining":[39],"logical":[41],"correctness":[42],"underlying":[45],"material":[46],"flow,":[47],"i.e.,":[48],"deadlock-free":[49],"operations.":[50],"An":[51],"approximation":[52],"scheme":[53],"optimal":[56],"policy":[57],"based":[60],"on":[61],"neuro-dynamic":[62],"programming":[63],"theory":[64],"proposed,":[66],"performance":[69],"assessed":[71],"through":[72],"numerical":[74],"experiment.":[75],"derived":[77],"results":[78],"indicate":[79],"proposed":[82],"method":[83],"holds":[84],"considerable":[85],"promise":[86],"providing":[88],"viable,":[90],"computationally":[91],"efficient":[92],"approach":[93],"problem,":[96],"highlight":[98],"directions":[99],"further":[101],"investigation.":[102]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}