{"id":"https://openalex.org/W2903666872","doi":"https://doi.org/10.1109/coase.2018.8560344","title":"SMT Solvers for Job-Shop Scheduling Problems: Models Comparison and Performance Evaluation","display_name":"SMT Solvers for Job-Shop Scheduling Problems: Models Comparison and Performance Evaluation","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2903666872","doi":"https://doi.org/10.1109/coase.2018.8560344","mag":"2903666872"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2018.8560344","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2018.8560344","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-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/A5064831005","display_name":"Sabino Francesco Roselli","orcid":"https://orcid.org/0000-0002-4845-3565"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Sabino Francesco Roselli","raw_affiliation_strings":["Department Electrical Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department Electrical Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047696349","display_name":"Kristofer Bengtsson","orcid":"https://orcid.org/0000-0002-5290-682X"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Kristofer Bengtsson","raw_affiliation_strings":["Department Electrical Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department Electrical Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108805135","display_name":"Knut \u00c5kesson","orcid":"https://orcid.org/0000-0001-6105-2726"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Knut Akesson","raw_affiliation_strings":["Department Electrical Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department Electrical Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064831005"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":3.4491,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.93651299,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"547","last_page":"552"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9947999715805054,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9836999773979187,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7506281137466431},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6234025955200195},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6194654107093811},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5800324082374573},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5181171298027039},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5091800093650818},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5090932250022888},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4731534421443939},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4648778438568115},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.45387333631515503},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.42906489968299866},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4271073341369629},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32721590995788574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28575700521469116},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22712430357933044},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.20134985446929932},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19723692536354065},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10506847500801086}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7506281137466431},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6234025955200195},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6194654107093811},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5800324082374573},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5181171298027039},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5091800093650818},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5090932250022888},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4731534421443939},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4648778438568115},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.45387333631515503},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.42906489968299866},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4271073341369629},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32721590995788574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28575700521469116},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22712430357933044},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.20134985446929932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19723692536354065},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10506847500801086},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/coase.2018.8560344","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2018.8560344","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},{"id":"pmh:oai:research.chalmers.se:508218","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/508218","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:research.chalmers.se:509425","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/281bb0a9-d46c-480e-ad39-d582ab3b303f","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W137584443","https://openalex.org/W153643573","https://openalex.org/W221832247","https://openalex.org/W602497127","https://openalex.org/W1022177737","https://openalex.org/W1480909796","https://openalex.org/W1481397690","https://openalex.org/W1544041853","https://openalex.org/W1974709582","https://openalex.org/W2027524005","https://openalex.org/W2071306171","https://openalex.org/W2076785727","https://openalex.org/W2120855292","https://openalex.org/W2137351629","https://openalex.org/W2145079270","https://openalex.org/W2156391157","https://openalex.org/W2157846217","https://openalex.org/W2159595840","https://openalex.org/W2170428215","https://openalex.org/W2295061292","https://openalex.org/W2327219468","https://openalex.org/W2518264398","https://openalex.org/W2755799179","https://openalex.org/W2917843279","https://openalex.org/W3036035835","https://openalex.org/W3134587112","https://openalex.org/W4246691913","https://openalex.org/W6608933274","https://openalex.org/W6628836516","https://openalex.org/W6683303659","https://openalex.org/W6759781625","https://openalex.org/W6779748562","https://openalex.org/W6790923158"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W2087572620","https://openalex.org/W1945774704","https://openalex.org/W1505872263","https://openalex.org/W4298153058","https://openalex.org/W4243317326","https://openalex.org/W2408080066","https://openalex.org/W2268872489"],"abstract_inverted_index":{"The":[0],"optimal":[1],"assignment":[2],"of":[3,19,36,96],"jobs":[4],"to":[5,31,33,76,103,136,148],"machines":[6],"is":[7,22,29,127,134],"a":[8,70,128],"common":[9],"problem":[10,26],"when":[11],"implementing":[12],"automated":[13],"production":[14],"systems.":[15],"A":[16],"specific":[17],"variant":[18],"this":[20],"category":[21],"the":[23,34,64,67,125],"job-shop":[24],"scheduling":[25],"(JSP)":[27],"that":[28,165],"known":[30],"belong":[32],"class":[35],"NP-hard":[37],"problems.":[38],"JSPs":[39],"are":[40,169],"typically":[41],"either":[42],"formulated":[43],"as":[44],"Mixed":[45],"Integer":[46],"Linear":[47],"Programming":[48],"(MILP)":[49],"problems":[50,89],"and":[51,111,113,144,156,163],"solved":[52],"by":[53],"general-purpose-MILP":[54],"solvers":[55,78,158],"or":[56],"approached":[57],"using":[58],"heuristic":[59],"algorithms":[60],"specifically":[61],"designed":[62],"for":[63,86],"purpose.":[65],"During":[66],"last":[68],"decade":[69],"new":[71],"approach,":[72],"satisfiability":[73],"(SAT),":[74],"led":[75],"develop":[77],"with":[79,120],"incredible":[80],"abilities":[81],"in":[82,141],"finding":[83],"feasible":[84],"solutions":[85],"hard":[87,130],"combinatorial":[88,131],"on":[90,159],"Boolean":[91],"variables.":[92],"Moreover,":[93],"an":[94,121],"extension":[95],"SAT,":[97],"Satisfability":[98],"Modulo":[99],"Theory":[100],"(SMT),":[101],"allows":[102],"formulate":[104],"constraints":[105],"involving":[106],"linear":[107],"operations":[108],"over":[109],"integers":[110],"reals":[112],"some":[114],"SMT-solvers":[115,139,168],"have":[116],"been":[117],"also":[118],"extended":[119],"optimizing":[122],"tool.":[123],"Since":[124],"JSP":[126,161],"well-known":[129],"problem,":[132],"it":[133,143],"interesting":[135],"evaluate":[137,153],"how":[138,145],"perform":[140],"solving":[142],"they":[146],"compare":[147],"traditional":[149],"MILP-solvers.":[150,173],"We":[151],"therefore":[152],"state-of-the-art":[154],"MILP":[155],"SMT":[157],"benchmark":[160],"instances":[162],"find":[164],"general-purpose":[166],"open-source":[167],"competitive":[170],"against":[171],"commercial":[172]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}