{"id":"https://openalex.org/W2103434379","doi":"https://doi.org/10.1109/tcad.2010.2061631","title":"A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem","display_name":"A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem","publication_year":2010,"publication_date":"2010-11-30","ids":{"openalex":"https://openalex.org/W2103434379","doi":"https://doi.org/10.1109/tcad.2010.2061631","mag":"2103434379"},"language":"en","primary_location":{"id":"doi:10.1109/tcad.2010.2061631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2010.2061631","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://porto.polito.it/2379337/1/riv10_02.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075895946","display_name":"Sergio Nocco","orcid":null},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Sergio Nocco","raw_affiliation_strings":["Dipartimento di Automatica e Informatica, Politecnico di Torino, Turin, Italy","Dipt. di Autom. e Inf., Politec. di Torino, Turin, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Automatica e Informatica, Politecnico di Torino, Turin, Italy","institution_ids":["https://openalex.org/I177477856"]},{"raw_affiliation_string":"Dipt. di Autom. e Inf., Politec. di Torino, Turin, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023997315","display_name":"Stefano Quer","orcid":"https://orcid.org/0000-0001-6835-8277"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Quer","raw_affiliation_strings":["Dipartimento di Automatica e Informatica, Politecnico di Torino, Turin, Italy","Dipt. di Autom. e Inf., Politec. di Torino, Turin, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Automatica e Informatica, Politecnico di Torino, Turin, Italy","institution_ids":["https://openalex.org/I177477856"]},{"raw_affiliation_string":"Dipt. di Autom. e Inf., Politec. di Torino, Turin, Italy","institution_ids":["https://openalex.org/I177477856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177477856"],"apc_list":null,"apc_paid":null,"fwci":0.3383,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.63925347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"12","first_page":"2027","last_page":"2040"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.993399977684021,"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/computer-science","display_name":"Computer science","score":0.7307744026184082},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5198647975921631},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.518643319606781},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5055623054504395},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4752773344516754},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4700671136379242},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4669075608253479},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43395358324050903},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3924839496612549},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31332969665527344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19249513745307922}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7307744026184082},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5198647975921631},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.518643319606781},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5055623054504395},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4752773344516754},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4700671136379242},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4669075608253479},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43395358324050903},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3924839496612549},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31332969665527344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19249513745307922},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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.1109/tcad.2010.2061631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2010.2061631","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-article"},{"id":"pmh:oai:porto.polito.it:2379337","is_oa":true,"landing_page_url":"http://porto.polito.it/2379337/1/riv10_02.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306402038","display_name":"PORTO Publications Open Repository TOrino (Politecnico di Torino)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177477856","host_organization_name":"Politecnico di Torino","host_organization_lineage":["https://openalex.org/I177477856"],"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":"ISSN:0278-0070","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:porto.polito.it:2379337","is_oa":true,"landing_page_url":"http://porto.polito.it/2379337/1/riv10_02.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306402038","display_name":"PORTO Publications Open Repository TOrino (Politecnico di Torino)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177477856","host_organization_name":"Politecnico di Torino","host_organization_lineage":["https://openalex.org/I177477856"],"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":"ISSN:0278-0070","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W54684292","https://openalex.org/W82625556","https://openalex.org/W106212867","https://openalex.org/W159797947","https://openalex.org/W1489067204","https://openalex.org/W1500096942","https://openalex.org/W1516564968","https://openalex.org/W1528279629","https://openalex.org/W1542414055","https://openalex.org/W1549449731","https://openalex.org/W1549987634","https://openalex.org/W1573865009","https://openalex.org/W1590867284","https://openalex.org/W1600919542","https://openalex.org/W1667362966","https://openalex.org/W1878516677","https://openalex.org/W1886297056","https://openalex.org/W1985602827","https://openalex.org/W1987734880","https://openalex.org/W1997066004","https://openalex.org/W2014328192","https://openalex.org/W2024148935","https://openalex.org/W2030356709","https://openalex.org/W2032187200","https://openalex.org/W2042521295","https://openalex.org/W2046239089","https://openalex.org/W2057831628","https://openalex.org/W2065323166","https://openalex.org/W2072997779","https://openalex.org/W2082752309","https://openalex.org/W2089017767","https://openalex.org/W2093842169","https://openalex.org/W2097023195","https://openalex.org/W2097689572","https://openalex.org/W2100577981","https://openalex.org/W2100882463","https://openalex.org/W2101508170","https://openalex.org/W2102016680","https://openalex.org/W2103184499","https://openalex.org/W2106614985","https://openalex.org/W2109710497","https://openalex.org/W2127856935","https://openalex.org/W2129183345","https://openalex.org/W2130664212","https://openalex.org/W2131065168","https://openalex.org/W2149111772","https://openalex.org/W2151398141","https://openalex.org/W2155870887","https://openalex.org/W2162327103","https://openalex.org/W2170907279","https://openalex.org/W3150965154","https://openalex.org/W4206807714","https://openalex.org/W4241233758","https://openalex.org/W4243058146","https://openalex.org/W4245606633","https://openalex.org/W4285719527","https://openalex.org/W4299869287","https://openalex.org/W6603334395","https://openalex.org/W6606539106","https://openalex.org/W6635353773","https://openalex.org/W6635738176","https://openalex.org/W6636950635","https://openalex.org/W6639360369","https://openalex.org/W6657910070","https://openalex.org/W6674998218","https://openalex.org/W6675330357"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2186864281","https://openalex.org/W2107725657","https://openalex.org/W4255427455","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W2115480761","https://openalex.org/W4386614288","https://openalex.org/W2920896101","https://openalex.org/W4385847558"],"abstract_inverted_index":{"The":[0,156],"task":[1],"graph":[2],"cost-optimal":[3],"scheduling":[4,8,45],"problem":[5],"consists":[6],"in":[7,47],"a":[9,16,40,55,63,75,79,110,114,126,141,146,162],"certain":[10],"number":[11],"of":[12,18,33,57,122,149,171],"interdependent":[13],"tasks":[14],"onto":[15],"set":[17,148],"heterogeneous":[19],"processors":[20],"(characterized":[21],"by":[22],"idle":[23],"and":[24,107,168,199],"running":[25],"rates":[26],"per":[27],"time":[28],"unit),":[29],"minimizing":[30],"the":[31,34,119,134,172,177,189,194],"cost":[32],"entire":[35],"process.":[36],"This":[37,131],"paper":[38],"provides":[39],"novel":[41],"formulation":[42],"for":[43,78,151],"this":[44,69],"puzzle,":[46],"which":[48,165],"an":[49],"optimal":[50],"solution":[51],"is":[52,159],"computed":[53],"through":[54],"sequence":[56,121],"binate":[58,196],"covering":[59,72,197],"problems,":[60,123],"hinged":[61],"within":[62],"bounded":[64],"model":[65],"checking":[66],"paradigm.":[67],"In":[68],"approach,":[70],"each":[71],"instance,":[73],"providing":[74],"min-cost":[76],"trace":[77],"given":[80],"schedule":[81,173],"depth,":[82],"can":[83],"be":[84,183],"solved":[85],"with":[86,161],"several":[87],"strategies,":[88],"resorting":[89],"to":[90,117,144,175,182],"minimum-cost":[91],"satisfiability":[92],"solvers":[93],"or":[94],"pseudo-Boolean":[95],"optimization":[96],"tools.":[97,205],"Unfortunately,":[98],"all":[99],"direct":[100],"resolution":[101],"methods":[102],"show":[103,187],"very":[104],"low":[105],"efficiency":[106],"scalability.":[108],"As":[109],"consequence,":[111],"we":[112],"introduce":[113],"specialized":[115],"method":[116,158],"solve":[118],"same":[120],"based":[124],"on":[125],"traditional":[127],"all-solution":[128],"SAT":[129,154],"solver.":[130],"approach":[132],"follows":[133],"\u201ccircuit":[135],"cofactoring\u201d":[136],"strategy,":[137],"as":[138],"it":[139,200],"exploits":[140],"powerful":[142],"technique":[143],"capture":[145],"large":[147],"solutions":[150],"any":[152],"new":[153],"counter-example.":[155],"overall":[157],"completed":[160],"branch-and-bound":[163],"heuristic":[164],"evaluates":[166],"lower":[167],"upper":[169],"bounds":[170],"length,":[174],"reduce":[176],"state":[178],"space":[179],"that":[180,188],"has":[181],"visited.":[184],"Our":[185],"results":[186],"proposed":[190],"strategy":[191],"significantly":[192],"improves":[193],"blind":[195],"schema,":[198],"outperforms":[201],"general":[202],"purpose":[203],"state-of-the-art":[204]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}