{"id":"https://openalex.org/W1788840340","doi":"https://doi.org/10.1142/s0129626416500018","title":"Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems","display_name":"Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems","publication_year":2016,"publication_date":"2016-03-01","ids":{"openalex":"https://openalex.org/W1788840340","doi":"https://doi.org/10.1142/s0129626416500018","mag":"1788840340"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626416500018","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626416500018","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1210.4673","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113566328","display_name":"Guillaume Aupy","orcid":null},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Guillaume Aupy","raw_affiliation_strings":["LIP \u2013 ENS Lyon, 46 All\u00e9e d\u2019Italie, 69364 Lyon Cedex 07, France","ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)","LIP - Laboratoire de l'Informatique du Parall\u00e9lisme (46 All\u00e9e d'Italie 69364 LYON CEDEX 07 - France)"],"affiliations":[{"raw_affiliation_string":"LIP \u2013 ENS Lyon, 46 All\u00e9e d\u2019Italie, 69364 Lyon Cedex 07, France","institution_ids":["https://openalex.org/I113428412"]},{"raw_affiliation_string":"ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)","institution_ids":["https://openalex.org/I4210144566"]},{"raw_affiliation_string":"LIP - Laboratoire de l'Informatique du Parall\u00e9lisme (46 All\u00e9e d'Italie 69364 LYON CEDEX 07 - France)","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I113428412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037778045","display_name":"Anne Beno\u00eet","orcid":"https://orcid.org/0000-0003-2910-3540"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Anne Benoit","raw_affiliation_strings":["LIP \u2013 ENS Lyon, 46 All\u00e9e d\u2019Italie, 69364 Lyon Cedex 07, France","ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)","LIP - Laboratoire de l'Informatique du Parall\u00e9lisme (46 All\u00e9e d'Italie 69364 LYON CEDEX 07 - France)"],"affiliations":[{"raw_affiliation_string":"LIP \u2013 ENS Lyon, 46 All\u00e9e d\u2019Italie, 69364 Lyon Cedex 07, France","institution_ids":["https://openalex.org/I113428412"]},{"raw_affiliation_string":"ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)","institution_ids":["https://openalex.org/I4210144566"]},{"raw_affiliation_string":"LIP - Laboratoire de l'Informatique du Parall\u00e9lisme (46 All\u00e9e d'Italie 69364 LYON CEDEX 07 - France)","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I113428412"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113566328"],"corresponding_institution_ids":["https://openalex.org/I113428412","https://openalex.org/I4210144566"],"apc_list":null,"apc_paid":null,"fwci":0.4178,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67137097,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"26","issue":"01","first_page":"1650001","last_page":"1650001"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.994700014591217,"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.994700014591217,"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/T12288","display_name":"Optimization and Search Problems","score":0.9944999814033508,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8258699178695679},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7093400955200195},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.677859365940094},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6511533856391907},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6155413389205933},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5084594488143921},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.49356138706207275},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4751717448234558},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46978774666786194},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.4495023787021637},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43764910101890564},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.43027758598327637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16844630241394043},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.10303092002868652}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8258699178695679},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7093400955200195},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.677859365940094},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6511533856391907},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6155413389205933},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5084594488143921},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.49356138706207275},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4751717448234558},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46978774666786194},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.4495023787021637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43764910101890564},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.43027758598327637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16844630241394043},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.10303092002868652},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129626416500018","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626416500018","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1210.4673","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1210.4673","pdf_url":"https://arxiv.org/pdf/1210.4673","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.1210.4673","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1210.4673","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1210.4673","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1210.4673","pdf_url":"https://arxiv.org/pdf/1210.4673","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.9100000262260437,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1483328847","https://openalex.org/W1909929165","https://openalex.org/W2001016215","https://openalex.org/W2011039300","https://openalex.org/W2014008637","https://openalex.org/W2028435775","https://openalex.org/W2041438374","https://openalex.org/W2042694839","https://openalex.org/W2085836112","https://openalex.org/W2088566334","https://openalex.org/W2100970777","https://openalex.org/W2104680817","https://openalex.org/W2119457900","https://openalex.org/W2138779116","https://openalex.org/W2139028666","https://openalex.org/W2139613807","https://openalex.org/W2165136860","https://openalex.org/W2165646063","https://openalex.org/W2486715098","https://openalex.org/W3122401610","https://openalex.org/W4236386887","https://openalex.org/W4236548448","https://openalex.org/W4245268476","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2368250618","https://openalex.org/W2810352541","https://openalex.org/W2970302286","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2142195909","https://openalex.org/W2048358792","https://openalex.org/W2098281589","https://openalex.org/W2962917430","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,59,70,83,88,100,107,112,120,130,190],"problem":[3,72],"of":[4,24,29,36,132,146],"scheduling":[5,71],"an":[6,183],"application":[7,14],"on":[8,87,92,119,129,189],"a":[9,16,21,27,52,64,104,117,127,156,187],"parallel":[10],"computational":[11],"platform.":[12],"The":[13,32],"is":[15,34,46,54,103,109,138],"particular":[17],"task":[18],"graph,":[19],"either":[20,86],"linear":[22,144,152],"chain":[23],"tasks,":[25,174],"or":[26,77,91],"set":[28],"independent":[30,149,173],"tasks.":[31,150],"platform":[33],"made":[35],"identical":[37],"processors,":[38],"whose":[39],"speed":[40],"can":[41],"be":[42],"dynamically":[43],"modified.":[44],"It":[45,102],"also":[47],"subject":[48],"to":[49,57,67,75,98,110,139],"failures:":[50],"if":[51],"processor":[53],"slowed":[55],"down":[56],"decrease":[58],"energy":[60,113],"consumption,":[61,114],"it":[62],"has":[63],"higher":[65],"chance":[66],"fail.":[68],"Therefore,":[69],"requires":[73],"us":[74],"re-execute":[76],"replicate":[78],"tasks":[79,147],"(i.e.,":[80],"execute":[81],"twice":[82],"same":[84,89],"task,":[85],"processor,":[90],"two":[93],"distinct":[94],"processors),":[95],"in":[96,180],"order":[97],"increase":[99],"reliability.":[101],"tri-criteria":[105],"problem:":[106],"goal":[108],"minimize":[111],"while":[115],"enforcing":[116],"bound":[118],"total":[121],"execution":[122],"time":[123],"(the":[124],"makespan),":[125],"and":[126,148,177],"constraint":[128],"reliability":[131],"each":[133],"task.":[134],"Our":[135],"main":[136],"contribution":[137],"propose":[140,179],"approximation":[141,159,170,184],"algorithms":[142],"for":[143,172],"chains":[145],"For":[151],"chains,":[153],"we":[154,162,178],"design":[155],"fully":[157],"polynomial-time":[158],"scheme.":[160],"However,":[161],"show":[163],"that":[164],"there":[165],"exists":[166],"no":[167],"constant":[168],"factor":[169],"algorithm":[171,185],"unless":[175],"P=NP,":[176],"this":[181],"case":[182],"with":[186],"relaxation":[188],"makespan":[191],"constraint.":[192]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2022-10-03T00:00:00"}