{"id":"https://openalex.org/W2974327281","doi":"https://doi.org/10.1109/coase.2019.8843025","title":"SMT Solvers for Flexible Job-Shop Scheduling Problems: A Computational Analysis","display_name":"SMT Solvers for Flexible Job-Shop Scheduling Problems: A Computational Analysis","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2974327281","doi":"https://doi.org/10.1109/coase.2019.8843025","mag":"2974327281"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2019.8843025","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2019.8843025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 15th 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":1.5228,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86076033,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"673","last_page":"678"},"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.995199978351593,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9833999872207642,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7413609027862549},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7291488647460938},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6897637248039246},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6031363606452942},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.551389753818512},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5473048090934753},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5329711437225342},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4630776345729828},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41992321610450745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18154460191726685},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1730670928955078},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09932214021682739}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7413609027862549},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7291488647460938},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6897637248039246},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6031363606452942},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.551389753818512},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5473048090934753},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5329711437225342},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4630776345729828},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41992321610450745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18154460191726685},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1730670928955078},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09932214021682739},{"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.2019.8843025","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2019.8843025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},{"id":"pmh:oai:research.chalmers.se:512847","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/512847","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:519216","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/7cef2b1b-2077-4d67-9abe-20a49ef225c3","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":[{"score":0.5,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W159012016","https://openalex.org/W602497127","https://openalex.org/W1480909796","https://openalex.org/W1969109994","https://openalex.org/W2040789431","https://openalex.org/W2046437335","https://openalex.org/W2072298242","https://openalex.org/W2098650167","https://openalex.org/W2103384158","https://openalex.org/W2122736695","https://openalex.org/W2134098988","https://openalex.org/W2137351629","https://openalex.org/W2159595840","https://openalex.org/W2166928920","https://openalex.org/W2518264398","https://openalex.org/W2903666872","https://openalex.org/W6683303659","https://openalex.org/W6756492737"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2011675579","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455"],"abstract_inverted_index":{"In":[0,97,127,153],"this":[1,28,66,154],"paper":[2],"we":[3,131,156],"evaluate":[4],"different":[5,79],"formulations":[6,160,172],"for":[7,162,165,196,198,204,216],"solving":[8,205,217],"the":[9,51,62,109,180,187,192],"Flexible":[10],"Job-shop":[11],"Scheduling":[12],"Problem":[13],"(FJSP)":[14],"to":[15,26,46,55,58,81,115,118,145,175],"optimality.":[16],"Heuristic":[17],"methods":[18,53],"resulting":[19],"in":[20,74],"sub-optimal":[21],"solutions":[22],"are":[23,71,78,173],"traditionally":[24],"used":[25,73,161,174],"solve":[27,120,176],"problem":[29],"since":[30],"it":[31],"is":[32,200],"a":[33,142,188,201,213],"known":[34],"NP-hard":[35,125],"problem.":[36],"Since":[37],"industrial":[38,75,218],"problems":[39,88],"often":[40,72],"have":[41,106,132,157],"additional":[42,63],"constraints":[43],"that":[44,70,90,134,186],"need":[45,54],"be":[47,56,92,116,141,210],"considered":[48,211],"during":[49],"optimization,":[50],"heuristic":[52],"adapted":[57,158,195],"deal":[59],"efficiently":[60,119],"with":[61,137],"constraints.":[64],"For":[65],"reason":[67],"general-purpose":[68],"solvers":[69,167],"applications.":[76],"There":[77],"approaches":[80],"formulate":[82],"FJSPs":[83,164,178,199],"as":[84,212],"Mixed-Integer":[85],"Linear":[86],"Programming":[87],"(MILP)":[89],"can":[91,140],"solved":[93],"using":[94,179],"generic":[95],"MILP-solvers.":[96],"recent":[98],"years,":[99],"satisfiability":[100],"solvers,":[101],"i.e.":[102],"SAT-":[103],"and":[104,113,208],"SMT-solvers,":[105],"evolved":[107],"within":[108],"formal":[110],"verification":[111],"community":[112],"shown":[114,133],"able":[117],"large":[121],"instances":[122],"of":[123],"well-known":[124],"problems.":[126,152,219],"our":[128],"previous":[129],"work":[130,155],"SMT-solvers":[135],"extended":[136],"optimization":[138],"techniques":[139],"competitive":[143,202],"alternative":[144,203,215],"commercial":[146],"MILP-solvers":[147],"on":[148,191],"traditional":[149],"job-shop":[150],"scheduling":[151],"three":[159,171],"formulating":[163],"MILP":[166],"into":[168],"SMT-formulations.":[169],"The":[170],"benchmark":[177],"open-source":[181],"Z3":[182],"SMT-solver.":[183],"We":[184],"show":[185],"formulation":[189,194],"based":[190],"Manne":[193],"SMT-formulations":[197],"large-scale":[206],"FJSPs,":[207],"might":[209],"viable":[214]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}