{"id":"https://openalex.org/W1988685065","doi":"https://doi.org/10.1109/tase.2013.2259816","title":"Solving assembly scheduling problems with tree-structure precedence constraints: A Lagrangian relaxation approach","display_name":"Solving assembly scheduling problems with tree-structure precedence constraints: A Lagrangian relaxation approach","publication_year":2013,"publication_date":"2013-05-21","ids":{"openalex":"https://openalex.org/W1988685065","doi":"https://doi.org/10.1109/tase.2013.2259816","mag":"1988685065"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2013.2259816","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2013.2259816","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/A5064130884","display_name":"Jingyang Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jingyang Xu","raw_affiliation_strings":["Department of Industrial and Systems Engineering, University of Buffalo, Buffalo, NY, USA","Dept. of Ind. & Syst. Eng., Univ. at Buffalo (SUNY), Buffalo, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Buffalo, Buffalo, NY, USA","institution_ids":["https://openalex.org/I63190737"]},{"raw_affiliation_string":"Dept. of Ind. & Syst. Eng., Univ. at Buffalo (SUNY), Buffalo, NY, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084546619","display_name":"Rakesh Nagi","orcid":"https://orcid.org/0000-0003-4022-6277"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rakesh Nagi","raw_affiliation_strings":["Department of Industrial and Systems Engineering, University of Buffalo, Buffalo, NY, USA","Dept. of Ind. & Syst. Eng., Univ. at Buffalo (SUNY), Buffalo, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Buffalo, Buffalo, NY, USA","institution_ids":["https://openalex.org/I63190737"]},{"raw_affiliation_string":"Dept. of Ind. & Syst. Eng., Univ. at Buffalo (SUNY), Buffalo, NY, USA","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064130884"],"corresponding_institution_ids":["https://openalex.org/I63190737"],"apc_list":null,"apc_paid":null,"fwci":5.5166,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.94826541,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"10","issue":"3","first_page":"757","last_page":"771"},"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.9986000061035156,"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.9944000244140625,"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/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.8580934405326843},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7270492315292358},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6743581891059875},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6640304923057556},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6300500631332397},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5315746068954468},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4709383249282837},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4630596339702606},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.445144385099411},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.42892542481422424},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4199594557285309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3133506178855896},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.09637290239334106},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.09559917449951172}],"concepts":[{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.8580934405326843},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7270492315292358},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6743581891059875},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6640304923057556},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6300500631332397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5315746068954468},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4709383249282837},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4630596339702606},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.445144385099411},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.42892542481422424},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4199594557285309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3133506178855896},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.09637290239334106},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.09559917449951172},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/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/tase.2013.2259816","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2013.2259816","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":[{"display_name":"Decent work and economic growth","score":0.6000000238418579,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320313934","display_name":"Institut national de recherche en informatique et en automatique (INRIA)","ror":"https://ror.org/02kvxyf05"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1479694349","https://openalex.org/W1507539267","https://openalex.org/W1969590301","https://openalex.org/W1984031944","https://openalex.org/W1990514741","https://openalex.org/W1994429799","https://openalex.org/W2003869323","https://openalex.org/W2007255274","https://openalex.org/W2007255736","https://openalex.org/W2018085234","https://openalex.org/W2019595142","https://openalex.org/W2030309123","https://openalex.org/W2031072026","https://openalex.org/W2038276127","https://openalex.org/W2039806905","https://openalex.org/W2039885954","https://openalex.org/W2041252124","https://openalex.org/W2057285547","https://openalex.org/W2065427999","https://openalex.org/W2071315752","https://openalex.org/W2078020766","https://openalex.org/W2088304441","https://openalex.org/W2116152588","https://openalex.org/W2122967269","https://openalex.org/W2130272456","https://openalex.org/W2137920965","https://openalex.org/W2150473588","https://openalex.org/W2169808125","https://openalex.org/W2171462754","https://openalex.org/W2518781185","https://openalex.org/W2743045177","https://openalex.org/W6685399759"],"related_works":["https://openalex.org/W4252122881","https://openalex.org/W3083877676","https://openalex.org/W134055995","https://openalex.org/W2009796757","https://openalex.org/W4302819359","https://openalex.org/W1973873435","https://openalex.org/W4244487479","https://openalex.org/W1963627056","https://openalex.org/W2769220156","https://openalex.org/W2142695913"],"abstract_inverted_index":{"In":[0,14],"this":[1,42],"paper,":[2],"we":[3],"consider":[4],"an":[5],"assembly":[6],"scheduling":[7,99],"problem":[8,72,86],"(ASP)":[9],"with":[10,47,73,116],"tree-structured":[11],"precedence":[12,49],"constraints.":[13,50],"our":[15],"problem,":[16],"there":[17],"are":[18,103],"a":[19,28,45,57,63,74,88,96,111],"number":[20,29],"of":[21,30,32,83],"work":[22,25,59],"centers.":[23],"Each":[24,51],"center":[26],"contains":[27],"machines":[31,121],"the":[33,54,71,81,84,106],"same":[34],"functionality.":[35],"The":[36],"job":[37,46,55],"to":[38,119],"be":[39],"processed":[40],"via":[41,87,95],"system":[43],"is":[44,109],"tree-structure":[48],"operation":[52],"in":[53],"has":[56],"designated":[58],"center.":[60],"We":[61,79],"propose":[62],"mixed":[64],"integer":[65],"linear":[66],"programming":[67],"formulation":[68],"and":[69,91,105,122],"solve":[70,80],"Lagrangian":[75],"relaxation":[76],"(LR)":[77],"approach.":[78],"subproblems":[82],"LR":[85],"heuristic":[89],"method":[90],"generate":[92],"feasible":[93],"solutions":[94],"randomized":[97],"list":[98],"algorithm.":[100],"Near-optimal":[101],"results":[102],"obtained":[104],"computational":[107],"time":[108],"within":[110],"few":[112],"seconds":[113],"for":[114],"problems":[115],"size":[117],"up":[118],"20":[120],"300":[123],"operations.":[124]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}