{"id":"https://openalex.org/W2156837885","doi":"https://doi.org/10.1051/ro:1999115","title":"The complexity of short schedules for uet bipartite graphs","display_name":"The complexity of short schedules for uet bipartite graphs","publication_year":1999,"publication_date":"1999-07-01","ids":{"openalex":"https://openalex.org/W2156837885","doi":"https://doi.org/10.1051/ro:1999115","mag":"2156837885"},"language":"en","primary_location":{"id":"doi:10.1051/ro:1999115","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:1999115","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"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"],"host_organization_lineage_names":["EDP Sciences"],"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":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/RO_1999__33_3_367_0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063171222","display_name":"Evripidis Bampis","orcid":"https://orcid.org/0000-0002-4498-3040"},"institutions":[{"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":"Evripidis Bampis","raw_affiliation_strings":["LaMI, Universit\u00e9 d'Evry Val d'Essonne, 91025 Evry Cedex, France E-mail: bampis@lami.univ-evry.fr"],"affiliations":[{"raw_affiliation_string":"LaMI, Universit\u00e9 d'Evry Val d'Essonne, 91025 Evry Cedex, France E-mail: bampis@lami.univ-evry.fr","institution_ids":["https://openalex.org/I88467170"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063171222"],"corresponding_institution_ids":["https://openalex.org/I88467170"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.27002541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"33","issue":"3","first_page":"367","last_page":"370"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9941999912261963,"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.9941999912261963,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9873999953269958,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9746999740600586,"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/bipartite-graph","display_name":"Bipartite graph","score":0.9025424718856812},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.620454728603363},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5720120072364807},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5088260769844055},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4886482357978821},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.4841345250606537},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41308704018592834},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39600956439971924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3788360357284546},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36409586668014526},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3426583409309387},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.294933557510376},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24991697072982788},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1887190341949463},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.05486428737640381}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9025424718856812},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.620454728603363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5720120072364807},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5088260769844055},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4886482357978821},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.4841345250606537},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41308704018592834},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39600956439971924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3788360357284546},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36409586668014526},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3426583409309387},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.294933557510376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24991697072982788},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1887190341949463},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.05486428737640381}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro:1999115","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:1999115","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"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"],"host_organization_lineage_names":["EDP Sciences"],"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:numdam.org:RO_1999__33_3_367_0","is_oa":true,"landing_page_url":"http://www.numdam.org/item/RO_1999__33_3_367_0/","pdf_url":"https://www.numdam.org/item/RO_1999__33_3_367_0.pdf","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:numdam.org:RO_1999__33_3_367_0","is_oa":true,"landing_page_url":"http://www.numdam.org/item/RO_1999__33_3_367_0/","pdf_url":"https://www.numdam.org/item/RO_1999__33_3_367_0.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2156837885.pdf","grobid_xml":"https://content.openalex.org/works/W2156837885.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2077383796","https://openalex.org/W2953461625","https://openalex.org/W2080136900","https://openalex.org/W2372768926","https://openalex.org/W2999799752","https://openalex.org/W2567825307","https://openalex.org/W2054458431","https://openalex.org/W2115167491","https://openalex.org/W1979183926"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"the":[3,16],"problem":[4,19],"of":[5,12,38,48],"deciding":[6],"if":[7],"there":[8],"is":[9],"a":[10,45],"schedule":[11],"length":[13],"three":[14],"for":[15,31,35],"multiprocessor":[17],"scheduling":[18],"on":[20],"identical":[21],"machines":[22],"and":[23,50],"unit":[24],"execution":[25],"time":[26],"tasks":[27],"in":[28],"-complete":[29],"even":[30],"bipartite":[32],"graphs,":[33],"i.e.":[34],"precedence":[36],"graphs":[37],"depth":[39],"one.":[40],"This":[41],"complexity":[42],"result":[43,47],"extends":[44],"classical":[46],"Lenstra":[49],"Rinnoy":[51],"Kan":[52],"[5].":[53]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}