{"id":"https://openalex.org/W1969678900","doi":"https://doi.org/10.1109/tase.2011.2168817","title":"Improvement of Lagrangian Relaxation Convergence for Production Scheduling","display_name":"Improvement of Lagrangian Relaxation Convergence for Production Scheduling","publication_year":2011,"publication_date":"2011-10-13","ids":{"openalex":"https://openalex.org/W1969678900","doi":"https://doi.org/10.1109/tase.2011.2168817","mag":"1969678900"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2011.2168817","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2011.2168817","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/A5029120192","display_name":"Roman Buil","orcid":"https://orcid.org/0000-0003-3755-8465"},"institutions":[{"id":"https://openalex.org/I123044942","display_name":"Universitat Aut\u00f2noma de Barcelona","ror":"https://ror.org/052g8jq94","country_code":"ES","type":"education","lineage":["https://openalex.org/I123044942"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"R. Buil","raw_affiliation_strings":["Department of Telecommunications and Systems Engineering, Universitat Aut\u00f2noma Barcelona, Barcelona, Spain","Dept. of Telecommun. & Syst. Eng., Univ. Autonoma de Barcelona, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications and Systems Engineering, Universitat Aut\u00f2noma Barcelona, Barcelona, Spain","institution_ids":["https://openalex.org/I123044942"]},{"raw_affiliation_string":"Dept. of Telecommun. & Syst. Eng., Univ. Autonoma de Barcelona, Barcelona, Spain","institution_ids":["https://openalex.org/I123044942"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033260693","display_name":"Miquel \u00c0ngel Piera","orcid":"https://orcid.org/0000-0002-7227-7944"},"institutions":[{"id":"https://openalex.org/I123044942","display_name":"Universitat Aut\u00f2noma de Barcelona","ror":"https://ror.org/052g8jq94","country_code":"ES","type":"education","lineage":["https://openalex.org/I123044942"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"M. A. Piera","raw_affiliation_strings":["Department of Telecommunications and Systems Engineering, Universitat Aut\u00f2noma Barcelona, Barcelona, Spain","Dept. of Telecommun. & Syst. Eng., Univ. Autonoma de Barcelona, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications and Systems Engineering, Universitat Aut\u00f2noma Barcelona, Barcelona, Spain","institution_ids":["https://openalex.org/I123044942"]},{"raw_affiliation_string":"Dept. of Telecommun. & Syst. Eng., Univ. Autonoma de Barcelona, Barcelona, Spain","institution_ids":["https://openalex.org/I123044942"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070935042","display_name":"Peter B. Luh","orcid":"https://orcid.org/0000-0002-5158-7388"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. B. Luh","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Connecticut, Storrs Mansfield, CT, USA","Dept. of Electr. & Comput. Eng., Univ. of Connecticut, Storrs, CT, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Connecticut, Storrs Mansfield, CT, USA","institution_ids":["https://openalex.org/I140172145"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Connecticut, Storrs, CT, USA#TAB#","institution_ids":["https://openalex.org/I140172145"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2325,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.94478039,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":"1","first_page":"137","last_page":"147"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9962999820709229,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9926999807357788,"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/subgradient-method","display_name":"Subgradient method","score":0.9139899611473083},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7389105558395386},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.7152301669120789},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6434811353683472},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6391727328300476},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6001322865486145},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.4893335700035095},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.41215255856513977},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.2517351806163788},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18764179944992065}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.9139899611473083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7389105558395386},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7152301669120789},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6434811353683472},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6391727328300476},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6001322865486145},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.4893335700035095},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.41215255856513977},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2517351806163788},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18764179944992065},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tase.2011.2168817","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2011.2168817","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.645.274","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.645.274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.engr.uconn.edu/msl/paper/Buil/Buil_2012.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2007255736","https://openalex.org/W2009367875","https://openalex.org/W2043193943","https://openalex.org/W2096467784","https://openalex.org/W2150473588","https://openalex.org/W2158023072","https://openalex.org/W2164802608","https://openalex.org/W2167897244","https://openalex.org/W4230506203","https://openalex.org/W6684546414"],"related_works":["https://openalex.org/W2037613239","https://openalex.org/W3183857959","https://openalex.org/W4243844638","https://openalex.org/W3032916910","https://openalex.org/W2894990380","https://openalex.org/W195910675","https://openalex.org/W2363143319","https://openalex.org/W2351035339","https://openalex.org/W1980006501","https://openalex.org/W2138760184"],"abstract_inverted_index":{"It":[0,98],"is":[1,48,66,149,170],"widely":[2],"accepted":[3],"that":[4,212],"new":[5],"production":[6],"scheduling":[7,43,53,90,134,207],"tools":[8],"are":[9,45,196],"playing":[10],"a":[11,49,129,142,185],"key":[12],"role":[13],"in":[14],"flexible":[15],"manufacturing":[16,42],"systems":[17],"to":[18,55,76,124,127,162,198],"improve":[19],"their":[20],"performance":[21],"by":[22,94,240],"avoiding":[23],"idleness":[24],"machines":[25],"while":[26],"minimizing":[27],"set-up":[28],"times":[29],"penalties,":[30],"reducing":[31],"penalties":[32],"for":[33,68,191],"do":[34],"not":[35],"delivering":[36],"orders":[37],"on":[38,88,120,145,205,230],"time,":[39],"etc.":[40],"Since":[41],"problems":[44,135],"NP-hard,":[46],"there":[47],"need":[50],"of":[51,104,132,152,187,215],"improving":[52],"methodologies":[54],"get":[56],"good":[57],"solutions":[58,235],"within":[59],"low":[60],"CPU":[61],"time.":[62],"Lagrangian":[63],"Relaxation":[64],"(LR)":[65],"known":[67],"handling":[69],"large-scale":[70],"separable":[71],"problems,":[72],"however,":[73],"the":[74,77,89,102,121,137,150,180,192,200,206,213,224,231,237],"convergence":[75],"optimal":[78],"solution":[79],"can":[80],"be":[81,100,125],"slow.":[82],"LR":[83,105,122,138,222,238],"needs":[84],"customized":[85],"parametrization,":[86],"depending":[87,204,229],"problem,":[91,232],"usually":[92],"made":[93],"an":[95,153],"expert":[96],"user.":[97],"would":[99],"interesting":[101],"use":[103,158],"without":[106,111,140],"being":[107],"and":[108,176,217,223],"expertise,":[109],"i.e.,":[110],"difficult":[112],"parameters":[113],"tuning.":[114],"This":[115],"paper":[116],"presents":[117],"innovative":[118],"approaches":[119],"method":[123,139,156,195,239],"able":[126],"develop":[128],"tool":[130],"capable":[131],"solve":[133],"applying":[136],"requiring":[141],"deep":[143],"expertise":[144],"it.":[146],"First":[147],"approach":[148,169],"improvement":[151],"already":[154],"existing":[155],"which":[157],"Constraint":[159],"Programming":[160],"(CP)":[161],"obtain":[163],"better":[164,234],"primal":[165],"cost":[166,182],"convergence.":[167,183],"Second":[168],"called":[171],"Extended":[172],"Subgradient":[173,193],"Information":[174],"(ESGI)":[175],"it":[177],"speed":[178],"up":[179],"dual":[181],"Finally,":[184],"set":[186],"step":[188,226],"size":[189,227],"rules":[190],"(SG)":[194],"compared":[197],"choose":[199],"most":[201],"appropriate":[202],"rule":[203,228],"problem.":[208],"Test":[209],"results":[210],"demonstrate":[211],"application":[214],"CP":[216],"ESGI":[218],"approaches,":[219],"together":[220],"with":[221],"selected":[225],"generates":[233],"than":[236],"itself.":[241]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}