{"id":"https://openalex.org/W435588996","doi":"https://doi.org/10.1007/978-3-642-40450-4_64","title":"Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling","display_name":"Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W435588996","doi":"https://doi.org/10.1007/978-3-642-40450-4_64","mag":"435588996"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40450-4_64","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_64","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00867456","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109582467","display_name":"Kim Thang Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210107733","display_name":"Informatique, Biologie Int\u00e9grative et Syst\u00e8mes Complexes","ror":"https://ror.org/01aqxgr98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210107733","https://openalex.org/I88467170"]},{"id":"https://openalex.org/I88467170","display_name":"Universit\u00e9 d'\u00c9vry Val-d'Essonne","ror":"https://ror.org/00e96v939","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Kim Thang Nguyen","raw_affiliation_strings":["IBISC, University of Evry Val d\u2019Essonne, France","IBISC, University of Evry Val d'Essonne, France"],"affiliations":[{"raw_affiliation_string":"IBISC, University of Evry Val d\u2019Essonne, France","institution_ids":["https://openalex.org/I88467170","https://openalex.org/I4210107733"]},{"raw_affiliation_string":"IBISC, University of Evry Val d'Essonne, France","institution_ids":["https://openalex.org/I88467170","https://openalex.org/I4210107733"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109582467"],"corresponding_institution_ids":["https://openalex.org/I4210107733","https://openalex.org/I88467170"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.3537,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.97259552,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"755","last_page":"766"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9987000226974487,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.8372182250022888},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.6928404569625854},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.6865437030792236},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6578261256217957},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5319735407829285},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5081794261932373},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.48982784152030945},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.469620019197464},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.44100311398506165},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.42734912037849426},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.418654203414917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41754698753356934},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3736608624458313},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.20715174078941345},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11331838369369507},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.07909324765205383},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07317736744880676}],"concepts":[{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.8372182250022888},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6928404569625854},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.6865437030792236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6578261256217957},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5319735407829285},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5081794261932373},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.48982784152030945},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.469620019197464},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.44100311398506165},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.42734912037849426},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.418654203414917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41754698753356934},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3736608624458313},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.20715174078941345},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11331838369369507},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.07909324765205383},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07317736744880676},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-40450-4_64","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_64","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-00867456v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00867456","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"21st European Symposium on Algorithms (ESA 2013), Sep 2013, Sophia Antipolis, France. pp.755--766, ⟨10.1007/978-3-642-40450-4_64⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00867456v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00867456","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"21st European Symposium on Algorithms (ESA 2013), Sep 2013, Sophia Antipolis, France. pp.755--766, ⟨10.1007/978-3-642-40450-4_64⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5099999904632568,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W165387623","https://openalex.org/W230344389","https://openalex.org/W1528157682","https://openalex.org/W1544574065","https://openalex.org/W1930431538","https://openalex.org/W1972868674","https://openalex.org/W1985595908","https://openalex.org/W1988278843","https://openalex.org/W2015231501","https://openalex.org/W2020082371","https://openalex.org/W2053806044","https://openalex.org/W2070226247","https://openalex.org/W2086365412","https://openalex.org/W2100283019","https://openalex.org/W2102252987","https://openalex.org/W2105862720","https://openalex.org/W2111339397","https://openalex.org/W2112288559","https://openalex.org/W2124402683","https://openalex.org/W2142339200","https://openalex.org/W2144402549","https://openalex.org/W2152025418","https://openalex.org/W2162654297","https://openalex.org/W2171261418","https://openalex.org/W2258448061","https://openalex.org/W2373773238","https://openalex.org/W2395177313","https://openalex.org/W2402977197","https://openalex.org/W2912168264","https://openalex.org/W4206478994","https://openalex.org/W4235684105","https://openalex.org/W4236661255","https://openalex.org/W4246623841","https://openalex.org/W4247529034","https://openalex.org/W4251791142","https://openalex.org/W4254087392","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3149469165","https://openalex.org/W4313484281","https://openalex.org/W181997498","https://openalex.org/W1984467068","https://openalex.org/W2080941243","https://openalex.org/W2027845496","https://openalex.org/W3126007678","https://openalex.org/W3213165575","https://openalex.org/W2391797119","https://openalex.org/W2136200239"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}