{"id":"https://openalex.org/W2740052322","doi":"https://doi.org/10.24963/ijcai.2017/86","title":"Personnel Scheduling as Satisfiability Modulo Theories","display_name":"Personnel Scheduling as Satisfiability Modulo Theories","publication_year":2017,"publication_date":"2017-07-28","ids":{"openalex":"https://openalex.org/W2740052322","doi":"https://doi.org/10.24963/ijcai.2017/86","mag":"2740052322"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2017/86","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/86","pdf_url":"https://www.ijcai.org/proceedings/2017/0086.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2017/0086.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040540316","display_name":"Christoph Erkinger","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Christoph Erkinger","raw_affiliation_strings":["TU Wien","Institute of Information Systems, TU Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Institute of Information Systems, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084546772","display_name":"Nysret Musliu","orcid":"https://orcid.org/0000-0002-3992-8637"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Nysret Musliu","raw_affiliation_strings":["TU Wien","Institute of Information Systems, TU Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Institute of Information Systems, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":1.344,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.83088864,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"614","last_page":"621"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"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.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9979000091552734,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9940999746322632,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7667005658149719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.689055323600769},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6744243502616882},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5963755249977112},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5497066974639893},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47970694303512573},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4704674184322357},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4452744126319885},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.42906442284584045},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42845290899276733},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42066490650177},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37104159593582153},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33973458409309387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20181965827941895},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16494551301002502},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10887411236763},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08735078573226929}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7667005658149719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.689055323600769},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6744243502616882},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5963755249977112},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5497066974639893},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47970694303512573},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4704674184322357},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4452744126319885},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.42906442284584045},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42845290899276733},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42066490650177},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37104159593582153},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33973458409309387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20181965827941895},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16494551301002502},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10887411236763},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08735078573226929},{"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},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2017/86","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/86","pdf_url":"https://www.ijcai.org/proceedings/2017/0086.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2017/86","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/86","pdf_url":"https://www.ijcai.org/proceedings/2017/0086.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5433622815","display_name":null,"funder_award_id":"P24814-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2740052322.pdf","grobid_xml":"https://content.openalex.org/works/W2740052322.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W79272510","https://openalex.org/W139304063","https://openalex.org/W1504520037","https://openalex.org/W1548812055","https://openalex.org/W1806875923","https://openalex.org/W1974942389","https://openalex.org/W1981106240","https://openalex.org/W2021421763","https://openalex.org/W2064228455","https://openalex.org/W2091607668","https://openalex.org/W2209708092","https://openalex.org/W3129170862"],"related_works":["https://openalex.org/W2578463151","https://openalex.org/W4243317326","https://openalex.org/W2087572620","https://openalex.org/W2810367355","https://openalex.org/W2275420537","https://openalex.org/W1483783534","https://openalex.org/W4379142300","https://openalex.org/W4302330337","https://openalex.org/W2048447692","https://openalex.org/W2131919998"],"abstract_inverted_index":{"Rotating":[0],"workforce":[1],"scheduling":[2],"(RWS)":[3],"is":[4,58],"an":[5,61,92,153],"important":[6,154],"real-life":[7],"personnel":[8],"rostering":[9],"problem":[10,66,81],"that":[11,32,78],"appears":[12],"in":[13,67,109,156],"a":[14,26,49,103,113,121],"large":[15],"number":[16,50,123,158],"of":[17,51,64,117,124,149,159],"different":[18,85,139],"business":[19],"areas.":[20],"In":[21],"this":[22,150],"paper,":[23],"we":[24,101],"propose":[25,71],"new":[27,73,104],"exact":[28,145],"approach":[29,94,151],"to":[30,59,111,143],"RWS":[31,77],"exploits":[33],"the":[34,54,65,80,118,147,157],"recent":[35],"advances":[36],"on":[37,96,107,133],"Satisfiability":[38],"Modulo":[39],"Theories":[40],"(SMT).":[41],"While":[42],"solving":[43],"can":[44],"be":[45],"automated":[46],"by":[47],"using":[48,82,138],"so-called":[52],"SMT-solvers,":[53],"most":[55],"challenging":[56],"task":[57],"find":[60],"efficient":[62],"formulation":[63,105],"first-order":[68],"logic.":[69],"We":[70],"two":[72,127],"modeling":[74,128],"techniques":[75],"for":[76],"encode":[79],"formulas":[83],"over":[84],"background":[86],"theories.":[87],"The":[88],"first":[89],"encoding":[90],"provides":[91],"elegant":[93],"based":[95,106],"linear":[97],"integer":[98],"arithmetic.":[99],"Furthermore,":[100],"developed":[102],"bitvectors":[108],"order":[110],"achieve":[112],"more":[114],"compact":[115],"representation":[116],"constraints":[119],"and":[120],"reduced":[122],"variables.":[125],"These":[126],"approaches":[129],"were":[130],"experimentally":[131],"evaluated":[132],"benchmark":[134],"instances":[135],"from":[136],"literature":[137],"state-of-the-art":[140],"SMT-solvers.":[141],"Compared":[142],"other":[144],"methods,":[146],"results":[148],"showed":[152],"improvement":[155],"found":[160],"solutions.":[161]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}