{"type":"ScholarlyArticle","title":"SAT-Based Approaches for the General High School Timetabling Problem","authors":[{"name":"Emir Demirović","slug":"emir-demirovic","given":"Emir","family":"Demirović","affiliation":"Database and Artificial Intelligence Group Vienna University of Technology (TU Wien) , Vienna , Austria"}],"abstract":"High School Timetabling (HSTT) is a well known and widespread problem. It consists of coordinating resources (e.g. teachers, rooms), times, and events (e.g. lectures) with respect to various constraints. In this paper, I summarize the work I have done towards exploring the relationship between propositional logic and HSTT. This includes various modeling techniques in the form of maxSAT and bitvectors, data structures for local search algorithms, and the combination of maxSAT and metaheuristic algorithms. In addition, I discuss possible directions for future work as a part of a long-term research goal to combine complete and metaheuristic algorithms.","doi":"10.24963/ijcai.2017/747","url":"https://ijcai.org/proceedings/2017/747","pdf":"https://ijcai.org/proceedings/2017/0747.pdf","markdown":"https://ijcai.org/proceedings/2017/747.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/747","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Doctoral Consortium","track":"Doctoral Consortium","number":747,"pages":{"first":5175,"last":5176},"keywords":["Artificial Intelligence: search and constraint satisfaction","Artificial Intelligence: formal methods","Artificial Intelligence: artificial intelligence","Artificial Intelligence: constraints"],"videos":[],"references":[{"position":1,"raw":"[de Uña et al., 2010] Diego de Uña, Graeme Gange, Peter Schachte, and Peter J. Stuckey. A bounded path propa- gator on directed graphs. In Proceedings of CP'16, pages 189-206, 2010.","title":"A bounded path propagator on directed graphs","authors":"De Uña","year":"2010","venue":"Proceedings of CP'16","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Demirović and Musliu, 2016] Emir Demirović and Nysret Musliu. Modeling High School Timetabling with Bitvec- tors. Annals of Operations Research, 2016.","title":"Emir Demirović and Nysret Musliu. Modeling High School Timetabling with Bitvectors","authors":"Musliu Demirović","year":"2016","venue":"Annals of Operations Research","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Demirović and Musliu, 2017a] Emir Demirović and Nysret Musliu. MaxSAT-Based Large Neighborhood Search for High School Timetabling. Computers & Operation Re- search, 78:172-180, 2017.","title":"Emir Demirović and Nysret Musliu. MaxSAT-Based Large Neighborhood Search for High School Timetabling","authors":"Musliu Demirović","year":"2017","venue":"Computers & Operation Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Demirović and Musliu, 2017b] Emir Demirović and Nys- ret Musliu. Modeling high school timetabling as partial weighted maxSAT. technical draft, 2017.","title":"Modeling high school timetabling as partial weighted maxSAT","authors":"Musliu Demirović","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Haken, 1995] Armin Haken. Counting bottlenecks to show monotone P <=> NP. In 36th Annual Symposium on Foundations of Computer Science, pages 36-40, 1995.","title":"Counting bottlenecks to show monotone P <=> NP","authors":"Armin Haken","year":"1995","venue":"th Annual Symposium on Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Kristiansen et al., 2015] Simon Kristiansen, Matias Sørensen, and Thomas R. Stidsen. Integer programming for the generalized high school timetabling problem. Journal of Scheduling, 18(4):377-392, 2015.","title":"Integer programming for the generalized high school timetabling problem","authors":"Simon Kristiansen, Matias Sørensen, Thomas R Stidsen","year":"2015","venue":"Journal of Scheduling","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Maniezzo et al., 2010] Vittorio Maniezzo, Thomas Stützle, and Stefan Voß, editors. Matheuristics -Hybridizing Meta- heuristics and Mathematical Programming, volume 10 of Annals of Information Systems. Springer, 2010.","title":"Matheuristics -Hybridizing Metaheuristics and Mathematical Programming","authors":null,"year":"2010","venue":"Annals of Information Systems","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Post et al., 2014] Gerhard Post, Jeffrey H. Kingston, Samad Ahmadi, Sophia Daskalaki, Christos Gogos, Jari Kyngäs, Cimmo Nurmi, Nysret Musliu, Nelishia Pillay, Haroldo Santos, and Andrea Schaerf. XHSTT: an XML archive for high school timetabling problems in different countries. Annals of Operations Research, 218(1):295-301, 2014.","title":"XHSTT: an XML archive for high school timetabling problems in different countries","authors":"Gerhard Post, Jeffrey H Kingston, Samad Ahmadi, Sophia Daskalaki, Christos Gogos, Jari Kyngäs, Cimmo Nurmi, Nysret Musliu, Nelishia Pillay, Haroldo Santos, Andrea Schaerf","year":"2014","venue":"Annals of Operations Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}