{"id":"https://openalex.org/W2529549492","doi":"https://doi.org/10.1051/ro/2016034","title":"Some complexity and approximation results for coupled-tasks scheduling problem according to topology","display_name":"Some complexity and approximation results for coupled-tasks scheduling problem according to topology","publication_year":2016,"publication_date":"2016-05-10","ids":{"openalex":"https://openalex.org/W2529549492","doi":"https://doi.org/10.1051/ro/2016034","mag":"2529549492"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2016034","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2016034","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1706.02214","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Benoit Darties","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I177064439","display_name":"Universit\u00e9 de Bourgogne","ror":"https://ror.org/03k1bsr36","country_code":"FR","type":"education","lineage":["https://openalex.org/I177064439"]},{"id":"https://openalex.org/I4210136953","display_name":"Laboratoire d\u2019\u00c9lectronique, Informatique et Image","ror":"https://ror.org/04gnd7c94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I190752583","https://openalex.org/I190861549","https://openalex.org/I4210118524","https://openalex.org/I4210134562","https://openalex.org/I4210136953","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Benoit Darties","raw_affiliation_strings":["LE2I, UMR CNRS 6306, University of Burgundy, 8 Rue Alain Savary, 21000 Dijon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LE2I, UMR CNRS 6306, University of Burgundy, 8 Rue Alain Savary, 21000 Dijon, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I177064439","https://openalex.org/I4210136953"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Rodolphe Giroudeau","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Rodolphe Giroudeau","raw_affiliation_strings":["LIRMM, UMR CNRS 5506, Universit\u00e9 de Montpellier, 161 rue Ada, 34392 Montpellier cedex 5, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIRMM, UMR CNRS 5506, Universit\u00e9 de Montpellier, 161 rue Ada, 34392 Montpellier cedex 5, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210101743"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jean-Claude K\u00f6nig","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Claude K\u00f6nig","raw_affiliation_strings":["LIRMM, UMR CNRS 5506, Universit\u00e9 de Montpellier, 161 rue Ada, 34392 Montpellier cedex 5, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIRMM, UMR CNRS 5506, Universit\u00e9 de Montpellier, 161 rue Ada, 34392 Montpellier cedex 5, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210101743"]}]},{"author_position":"last","author":{"id":null,"display_name":"Gilles Simonin","orcid":null},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Gilles Simonin","raw_affiliation_strings":["Insight Centre for Data Analytics, University College Cork, Cork, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Insight Centre for Data Analytics, University College Cork, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":0,"currency":"EUR","value_usd":0},"apc_paid":null,"fwci":0.7575,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78850391,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"50","issue":"4-5","first_page":"781","last_page":"795"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.21170000731945038,"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.21170000731945038,"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/T12176","display_name":"Optimization and Packing Problems","score":0.20010000467300415,"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.09459999948740005,"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.6926000118255615},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5339999794960022},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5184999704360962},{"id":"https://openalex.org/keywords/compatibility","display_name":"Compatibility (geochemistry)","score":0.5163000226020813},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5002999901771545},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.461899995803833},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.40290001034736633},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4016999900341034}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6926000118255615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6222000122070312},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5339999794960022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5231999754905701},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5184999704360962},{"id":"https://openalex.org/C2778648169","wikidata":"https://www.wikidata.org/wiki/Q967768","display_name":"Compatibility (geochemistry)","level":2,"score":0.5163000226020813},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5002999901771545},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.461899995803833},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.40290001034736633},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4016999900341034},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.3758000135421753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37459999322891235},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.36469998955726624},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.34279999136924744},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.32659998536109924},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.2759000062942505},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.265500009059906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26429998874664307},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1051/ro/2016034","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2016034","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1706.02214","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1706.02214","pdf_url":"https://arxiv.org/pdf/1706.02214","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-01533981v1","is_oa":true,"landing_page_url":"https://ube.hal.science/hal-01533981","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":"RAIRO - Operations Research, 2016, 50, pp.781-795. ⟨10.1051/ro/2016034⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:lirmm-01378511v1","is_oa":false,"landing_page_url":"https://hal-lirmm.ccsd.cnrs.fr/lirmm-01378511","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0399-0559","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:numdam.org:RO_2016__50_4-5_781_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2016034/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1706.02214","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1706.02214","pdf_url":"https://arxiv.org/pdf/1706.02214","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1985321454","https://openalex.org/W1990489976","https://openalex.org/W1996979574"],"related_works":[],"abstract_inverted_index":{"We":[0,35],"consider":[1],"the":[2,26,48],"makespan":[3],"minimization":[4],"coupled-tasks":[5,24],"problem":[6,71],"in":[7,39],"presence":[8],"of":[9,41],"compatibility":[10,49],"constraints":[11],"with":[12],"a":[13,58],"specified":[14],"topology.":[15],"In":[16,56],"particular,":[17],"we":[18,60],"focus":[19],"on":[20],"stretched":[21],"coupled-tasks,":[22],"i.e.":[23],"having":[25],"same":[27],"sub-tasks":[28],"execution":[29],"time":[30,33],"and":[31,44],"idle":[32],"duration.":[34],"study":[36],"several":[37],"problems":[38],"framework":[40],"classic":[42],"complexity":[43],"approximation":[45,65],"for":[46,67],"which":[47],"graph":[50],"is":[51],"bipartite":[52],"(star,":[53],"chain,":[54],"...).":[55],"such":[57],"context,":[59],"design":[61],"some":[62,74],"efficient":[63],"polynomial-time":[64],"algorithms":[66],"an":[68],"intractable":[69],"scheduling":[70],"according":[72],"to":[73],"parameters.":[75]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-10-14T00:00:00"}