{"id":"https://openalex.org/W2154260387","doi":"https://doi.org/10.1051/ro:2007036","title":"Reservation table scheduling: branch-and-bound based optimization<i>vs</i>. integer linear programming techniques","display_name":"Reservation table scheduling: branch-and-bound based optimization<i>vs</i>. integer linear programming techniques","publication_year":2007,"publication_date":"2007-10-01","ids":{"openalex":"https://openalex.org/W2154260387","doi":"https://doi.org/10.1051/ro:2007036","mag":"2154260387"},"language":"en","primary_location":{"id":"doi:10.1051/ro:2007036","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2007036","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"],"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046969653","display_name":"Hadda Cherroun","orcid":"https://orcid.org/0000-0002-5117-0320"},"institutions":[{"id":"https://openalex.org/I50219554","display_name":"University of Laghouat","ror":"https://ror.org/018bbh535","country_code":"DZ","type":"education","lineage":["https://openalex.org/I50219554"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Hadda Cherroun","raw_affiliation_strings":["Amar Telidji University, BP. 37G, 03000 Laghouat, Algeria; hadda_cherroun@mail.lagh-univ.dz","Amar Telidji University, BP. 37G, 03000 Laghouat, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Amar Telidji University, BP. 37G, 03000 Laghouat, Algeria; hadda_cherroun@mail.lagh-univ.dz","institution_ids":["https://openalex.org/I50219554"]},{"raw_affiliation_string":"Amar Telidji University, BP. 37G, 03000 Laghouat, Algeria","institution_ids":["https://openalex.org/I50219554"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058222450","display_name":"Alain Darte","orcid":null},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"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/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/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"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":"Alain Darte","raw_affiliation_strings":["LIP, ENS-Lyon (INRIA, CNRS, UCBL), 46 All\u00e9e d'Italie, 69007\u00a0Lyon, France; alain.darte@ens-lyon.fr","LIP, ENS-Lyon (INRIA, CNRS, UCBL), 46 All\u00e9e d'Italie, 69007\u00a0Lyon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP, ENS-Lyon (INRIA, CNRS, UCBL), 46 All\u00e9e d'Italie, 69007\u00a0Lyon, France; alain.darte@ens-lyon.fr","institution_ids":["https://openalex.org/I113428412","https://openalex.org/I100532134","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LIP, ENS-Lyon (INRIA, CNRS, UCBL), 46 All\u00e9e d'Italie, 69007\u00a0Lyon, France","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I100532134","https://openalex.org/I1326498283","https://openalex.org/I1294671590","https://openalex.org/I113428412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112773796","display_name":"Paul Feautrier","orcid":null},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"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/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/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"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":"Paul Feautrier","raw_affiliation_strings":["LIP, ENS-Lyon (INRIA, CNRS, UCBL), 46 All\u00e9e d'Italie, 69007\u00a0Lyon, France; alain.darte@ens-lyon.fr","LIP, ENS-Lyon (INRIA, CNRS, UCBL), 46 All\u00e9e d'Italie, 69007\u00a0Lyon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP, ENS-Lyon (INRIA, CNRS, UCBL), 46 All\u00e9e d'Italie, 69007\u00a0Lyon, France; alain.darte@ens-lyon.fr","institution_ids":["https://openalex.org/I113428412","https://openalex.org/I100532134","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LIP, ENS-Lyon (INRIA, CNRS, UCBL), 46 All\u00e9e d'Italie, 69007\u00a0Lyon, France","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I100532134","https://openalex.org/I1326498283","https://openalex.org/I1294671590","https://openalex.org/I113428412"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.15036496,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"41","issue":"4","first_page":"427","last_page":"454"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.7570971846580505},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5780302286148071},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5751035809516907},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5647685527801514},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5630647540092468},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5506989359855652},{"id":"https://openalex.org/keywords/macro","display_name":"Macro","score":0.48916128277778625},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.46299561858177185},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4418637454509735},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.43457871675491333},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.43269652128219604},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4319213628768921},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3519970774650574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19467684626579285},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.14133071899414062},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09148362278938293}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7570971846580505},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5780302286148071},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5751035809516907},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5647685527801514},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5630647540092468},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5506989359855652},{"id":"https://openalex.org/C166955791","wikidata":"https://www.wikidata.org/wiki/Q629579","display_name":"Macro","level":2,"score":0.48916128277778625},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.46299561858177185},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4418637454509735},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.43457871675491333},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.43269652128219604},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4319213628768921},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3519970774650574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19467684626579285},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.14133071899414062},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09148362278938293},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro:2007036","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2007036","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"],"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_2007__41_4_427_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro:2007036/","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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W37253703","https://openalex.org/W69821081","https://openalex.org/W1509116297","https://openalex.org/W1525175484","https://openalex.org/W1569643709","https://openalex.org/W1584569710","https://openalex.org/W1972763734","https://openalex.org/W1980310053","https://openalex.org/W2029706450","https://openalex.org/W2038318232","https://openalex.org/W2103581911","https://openalex.org/W2121424844","https://openalex.org/W2127218465","https://openalex.org/W2138092512","https://openalex.org/W2156323558","https://openalex.org/W2157554674","https://openalex.org/W2159754498","https://openalex.org/W2171318521","https://openalex.org/W2295627138","https://openalex.org/W2505968561","https://openalex.org/W2983923412","https://openalex.org/W4213172915","https://openalex.org/W4234537939","https://openalex.org/W6604348368"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2167574351","https://openalex.org/W2372008037","https://openalex.org/W2225350526","https://openalex.org/W4300092030","https://openalex.org/W4386580182","https://openalex.org/W1545991362","https://openalex.org/W2377713709","https://openalex.org/W3184267879","https://openalex.org/W2172075652"],"abstract_inverted_index":{"The":[0,194,241,259],"recourse":[1],"to":[2,47,159,170,175,181,187,209],"operation":[3],"research":[4],"solutions":[5,266],"has":[6],"strongly":[7],"increased":[8],"the":[9,15,53,68,101,129,161,253,256,262],"performances":[10],"of":[11,52,67,75,79,84,100,148,229,249,264],"scheduling":[12,38,45,115,121,152,154],"task":[13],"in":[14,39,58,191],"High-Level":[16],"Synthesis":[17],"(called":[18],"hardware":[19],"compilation).":[20],"Scheduling":[21],"a":[22,64,73,82,106],"whole":[23,54],"program":[24,55],"is":[25,164,169,185,197,217,225,236],"not":[26],"possible":[27,186],"as":[28,136],"too":[29],"many":[30],"constraints":[31,143],"and":[32,50,90,174,243,255],"objectives":[33],"interact.":[34],"We":[35],"decompose":[36],"high-level":[37,268],"three":[40],"steps.":[41],"Step":[42,86,112],"1:":[43],"Coarse-grain":[44],"tries":[46],"exploit":[48],"parallelism":[49],"locality":[51],"(in":[56],"particular":[57],"loops,":[59],"possibly":[60],"imperfectly":[61],"nested)":[62],"with":[63,156],"rough":[65],"view":[66],"target":[69,102],"architecture.":[70,103],"This":[71,104,125],"produces":[72,105],"sequence":[74],"logical":[76,118],"steps,":[77],"each":[78,92,110,117,223],"which":[80,206],"contains":[81],"pool":[83],"macro-tasks.":[85,124],"2:":[87],"Micro-scheduling":[88],"maps":[89],"schedules":[91],"macro-task":[93],"independently":[94],"taking":[95],"into":[96],"account":[97],"all":[98,122],"peculiarities":[99],"reservation":[107,137,157],"table":[108],"for":[109,204,239,267],"macro-task.":[111],"3:":[113],"Fine-grain":[114],"refines":[116],"step":[119],"by":[120,227],"its":[123],"paper":[126],"focuses":[127],"on":[128,178,199,247],"third":[130],"step.":[131],"As":[132,150],"tasks":[133,155],"are":[134,245],"modeled":[135],"tables,":[138],"we":[139,207],"can":[140],"express":[141],"resource":[142],"using":[144],"dis-equations":[145],"(i.e.,":[146],"negations":[147],"equations).":[149],"most":[151],"problems,":[153],"tables":[158],"minimize":[160],"total":[162],"duration":[163],"NP-complete.":[165],"Our":[166,213],"goal":[167],"here":[168],"design":[171],"different":[172],"strategies":[173],"evaluate":[176],"them,":[177],"practical":[179],"examples,":[180],"see":[182],"if":[183],"it":[184],"find":[188],"optimal":[189],"solution":[190],"reasonable":[192],"time.":[193],"first":[195],"algorithm":[196],"based":[198],"integer":[200],"linear":[201],"programming":[202],"techniques":[203],"scheduling,":[205],"adapt":[208],"our":[210],"specific":[211],"problem.":[212],"main":[214],"algorithmic":[215],"contribution":[216],"an":[218],"exact":[219],"branch-and-bound":[220],"algorithm,":[221],"where":[222],"evaluation":[224,242],"accelerated":[226],"variant":[228],"Dijkstra's":[230],"algorithm.":[231],"A":[232],"simple":[233],"greedy":[234],"heuristic":[235],"also":[237],"proposed":[238],"comparisons.":[240],"comparison":[244],"done":[246],"pieces":[248],"scientific":[250],"applications":[251],"from":[252],"PerfectClub":[254],"HLSynth95":[257],"benchmarks.":[258],"results":[260],"demonstrate":[261],"suitability":[263],"these":[265],"synthesis":[269],"scheduling.":[270]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-07T06:14:10.401900","created_date":"2016-06-24T00:00:00"}