{"id":"https://openalex.org/W2167308866","doi":"https://doi.org/10.1109/iros.2003.1249214","title":"A new lagrangian relaxation based method to improve schedule quality","display_name":"A new lagrangian relaxation based method to improve schedule quality","publication_year":2004,"publication_date":"2004-07-08","ids":{"openalex":"https://openalex.org/W2167308866","doi":"https://doi.org/10.1109/iros.2003.1249214","mag":"2167308866"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2003.1249214","is_oa":false,"landing_page_url":"http://doi.org/10.1109/iros.2003.1249214","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453)","raw_type":"proceedings-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/A5011760005","display_name":"Danqing Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Danqing Yu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5070935042","display_name":"Peter B. Luh","orcid":"https://orcid.org/0000-0002-5158-7388"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P.B. Luh","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011760005"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6782,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.8652864,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"3","issue":null,"first_page":"2303","last_page":"2308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8924658298492432},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6953960061073303},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.6432419419288635},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6269500255584717},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.5690522789955139},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5027165412902832},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37285369634628296},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.1737966239452362},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.13466984033584595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13053318858146667}],"concepts":[{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.8924658298492432},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6953960061073303},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.6432419419288635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6269500255584717},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.5690522789955139},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5027165412902832},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37285369634628296},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.1737966239452362},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.13466984033584595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13053318858146667},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2003.1249214","is_oa":false,"landing_page_url":"http://doi.org/10.1109/iros.2003.1249214","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2007255736","https://openalex.org/W2009367875","https://openalex.org/W2118756165","https://openalex.org/W2150473588","https://openalex.org/W2158023072","https://openalex.org/W2158080541","https://openalex.org/W2162801660","https://openalex.org/W2164802608","https://openalex.org/W2168324649","https://openalex.org/W2798766386","https://openalex.org/W3147646612","https://openalex.org/W4242209908","https://openalex.org/W6677650319","https://openalex.org/W6750230808"],"related_works":["https://openalex.org/W3149469165","https://openalex.org/W4313484281","https://openalex.org/W2363143319","https://openalex.org/W4383905034","https://openalex.org/W2127198104","https://openalex.org/W1984467068","https://openalex.org/W3126007678","https://openalex.org/W2534690099","https://openalex.org/W2170308554","https://openalex.org/W2950615969"],"abstract_inverted_index":{"Lagrangian":[0],"Relaxation":[1],"(LR)":[2],"bas":[3],"been":[4],"used":[5,82],"for":[6],"manufacturing":[7],"scheduling":[8],"with":[9,58,99,115],"good":[10,30,113],"results.":[11],"For":[12],"practical":[13],"applications,":[14],"the":[15,64,69,74,85,100,104],"method,":[16,103],"however,":[17],"may":[18,24],"suffer":[19],"from":[20],"slow":[21],"convergence,":[22],"and":[23,40,87,91,111],"not":[25],"be":[26],"able":[27],"to":[28,63,83,88],"generate":[29],"results":[31,95],"within":[32],"a":[33,43,77],"required":[34],"CPU":[35],"time.":[36],"To":[37,67],"improve":[38],"convergence":[39],"solution":[41],"quality,":[42],"new":[44],"augmented":[45,105],"LR":[46,102,106],"method":[47,107],"is":[48,61,81,108],"presented":[49],"in":[50],"this":[51],"paper":[52],"where":[53],"additional":[54],"penalty":[55,75],"terms":[56],"associated":[57],"constraint":[59],"violation":[60],"added":[62],"objective":[65],"function.":[66],"overcome":[68],"inseparability":[70],"difficulty":[71],"caused":[72],"by":[73],"term,":[76],"surrogate":[78],"subgradient":[79],"direction":[80],"update":[84],"multipliers":[86],"guarantee":[89],"solvability":[90],"convergence.":[92],"Numerical":[93],"testing":[94],"demonstrate":[96],"that":[97],"compared":[98],"standard":[101],"computationally":[109],"efficient,":[110],"generates":[112],"schedules":[114],"reduced":[116],"cost.":[117]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}