{"id":"https://openalex.org/W7124149327","doi":"https://doi.org/10.1109/codit66093.2025.11321384","title":"A Comparative Study of SMT and MILP for the Nurse Rostering Problem","display_name":"A Comparative Study of SMT and MILP for the Nurse Rostering Problem","publication_year":2025,"publication_date":"2025-07-15","ids":{"openalex":"https://openalex.org/W7124149327","doi":"https://doi.org/10.1109/codit66093.2025.11321384"},"language":null,"primary_location":{"id":"doi:10.1109/codit66093.2025.11321384","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit66093.2025.11321384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 11th International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5114319970","display_name":"Alvin Combrink","orcid":null},"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":"Alvin Combrink","raw_affiliation_strings":["Chalmers University of Technology,Division of Systems and Control,Department of Electrical Engineering,Göteborg,Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology,Division of Systems and Control,Department of Electrical Engineering,Göteborg,Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120005244","display_name":"Stephie Do","orcid":null},"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":"Stephie Do","raw_affiliation_strings":["Chalmers University of Technology,Division of Systems and Control,Department of Electrical Engineering,Göteborg,Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology,Division of Systems and Control,Department of Electrical Engineering,Göteborg,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/I1340210623","display_name":"Volvo (Sweden)","ror":"https://ror.org/05b6ypc36","country_code":"SE","type":"company","lineage":["https://openalex.org/I1340210623"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Kristofer Bengtsson","raw_affiliation_strings":["Group Trucks Operations, Volvo AB Göteborg,Research and Technology Development,Sweden"],"affiliations":[{"raw_affiliation_string":"Group Trucks Operations, Volvo AB Göteborg,Research and Technology Development,Sweden","institution_ids":["https://openalex.org/I1340210623"]}]},{"author_position":"middle","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":false,"raw_author_name":"Sabino Francesco Roselli","raw_affiliation_strings":["Chalmers University of Technology,Division of Systems and Control,Department of Electrical Engineering,Göteborg,Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology,Division of Systems and Control,Department of Electrical Engineering,Göteborg,Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017972835","display_name":"Martin Fabian","orcid":"https://orcid.org/0000-0003-1287-9748"},"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":"Martin Fabian","raw_affiliation_strings":["Chalmers University of Technology,Division of Systems and Control,Department of Electrical Engineering,Göteborg,Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology,Division of Systems and Control,Department of Electrical Engineering,Göteborg,Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5114319970"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.77248822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2105","last_page":"2110"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9587000012397766,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9587000012397766,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11773","display_name":"Healthcare Operations and Scheduling Optimization","score":0.012900000438094139,"subfield":{"id":"https://openalex.org/subfields/3604","display_name":"Emergency Medical Services"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.011099999770522118,"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.8845999836921692},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.8194000124931335},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6107000112533569},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5648000240325928},{"id":"https://openalex.org/keywords/nurse-scheduling-problem","display_name":"Nurse scheduling problem","score":0.5181000232696533},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4952000081539154},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.4772999882698059},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4474000036716461},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4171000123023987}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8845999836921692},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8194000124931335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7275999784469604},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6107000112533569},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5648000240325928},{"id":"https://openalex.org/C102370290","wikidata":"https://www.wikidata.org/wiki/Q7070210","display_name":"Nurse scheduling problem","level":5,"score":0.5181000232696533},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4952000081539154},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4819999933242798},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.4772999882698059},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4474000036716461},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4171000123023987},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3756999969482422},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.36070001125335693},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.32839998602867126},{"id":"https://openalex.org/C160735492","wikidata":"https://www.wikidata.org/wiki/Q31207","display_name":"Health care","level":2,"score":0.32659998536109924},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.31949999928474426},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3075999915599823},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.289000004529953},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2750999927520752},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit66093.2025.11321384","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit66093.2025.11321384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 11th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W175209279","https://openalex.org/W221832247","https://openalex.org/W1480909796","https://openalex.org/W1572910922","https://openalex.org/W1968603147","https://openalex.org/W1981106240","https://openalex.org/W2016721869","https://openalex.org/W2034438127","https://openalex.org/W2040294444","https://openalex.org/W2057093937","https://openalex.org/W2057865045","https://openalex.org/W2089584418","https://openalex.org/W2123696861","https://openalex.org/W2138801632","https://openalex.org/W2146110773","https://openalex.org/W2149929637","https://openalex.org/W2171615581","https://openalex.org/W2740052322","https://openalex.org/W2903666872","https://openalex.org/W2921419167","https://openalex.org/W3124397511","https://openalex.org/W4221035435"],"related_works":[],"abstract_inverted_index":{"The":[0],"effects":[1],"of":[2,8,27,68,94,137,169,222],"personnel":[3,15,223],"scheduling":[4,31,96],"on":[5,120],"the":[6,21,56,61,66,99,113,139,146,154,173,184,191,193,220],"quality":[7],"care":[9],"and":[10,24,106,109,118,122,171,201],"working":[11],"conditions":[12],"for":[13,39,134,216],"healthcare":[14,30],"have":[16,72],"been":[17,37,73],"thoroughly":[18],"documented.":[19],"However,":[20],"ever-present":[22],"demand":[23],"large":[25],"variation":[26],"constraints":[28,101,195],"make":[29],"particularly":[32],"challenging.":[33],"This":[34],"problem":[35,147],"has":[36,52],"studied":[38],"decades,":[40,63],"with":[41],"limited":[42],"research":[43,218],"aimed":[44],"at":[45],"applying":[46],"Satisfiability":[47],"Modulo":[48],"Theories":[49],"(SMT).":[50],"SMT":[51,69,105,155,174,185],"gained":[53],"momentum":[54],"within":[55,219],"formal":[57],"verification":[58],"community":[59],"in":[60],"last":[62],"leading":[64],"to":[65,75,111,190,203],"advancement":[67],"solvers":[70],"that":[71,88,183,209],"shown":[74],"outperform":[76],"standard":[77],"mathematical":[78],"programming":[79],"techniques.In":[80],"this":[81],"work,":[82],"we":[83],"propose":[84],"generic":[85,100,194],"constraint":[86],"formulations":[87],"can":[89],"model":[90],"a":[91,165,213],"wide":[92],"range":[93],"real-world":[95,123,161],"constraints.":[97],"Then,":[98],"are":[102],"formulated":[103],"as":[104],"MILP":[107,140],"problems":[108,163],"used":[110],"compare":[112],"respective":[114],"state-of-the-art":[115],"solvers,":[116],"Z3":[117],"Gurobi,":[119],"academic":[121],"inspired":[124,162],"rostering":[125],"problems.":[126],"Experimental":[127],"results":[128],"show":[129],"how":[130],"each":[131],"solver":[132,141,156,175,186],"excels":[133],"certain":[135],"types":[136],"problems;":[138],"generally":[142],"performs":[143,157],"better":[144,158,205],"when":[145],"is":[148],"highly":[149],"constrained":[150],"or":[151],"infeasible,":[152],"while":[153],"otherwise.":[159],"On":[160],"containing":[164],"more":[166,188],"varied":[167],"set":[168],"shifts":[170],"personnel,":[172],"excels.":[176],"Additionally,":[177],"it":[178],"was":[179,187],"noted":[180],"during":[181],"experimentation":[182,202],"sensitive":[189],"way":[192],"were":[196],"formulated,":[197],"requiring":[198],"careful":[199],"consideration":[200],"achieve":[204],"performance.":[206],"We":[207],"conclude":[208],"SMT-based":[210],"methods":[211],"present":[212],"promising":[214],"avenue":[215],"future":[217],"domain":[221],"scheduling.":[224]},"counts_by_year":[],"updated_date":"2026-01-16T23:16:36.188383","created_date":"2026-01-15T00:00:00"}