TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Nysret Musliu

Associate Prof. Dipl.-Ing. Dr.techn.

Research Focus

  • Logic and Computation: 100%

Research Areas

  • Search methods in AI, Heuristic Methods, Constraint Satisfaction, Machine Learning and Optimization, Scheduling and Timetabling, Problem solving
Nysret Musliu

Role

Contact

2023W

2024S

 

2022

  • ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (Extended Abstract) / Eiter, T., Geibinger, T., Higuera, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (Extended Abstract). In Proceedings of the 5th Workshop on Trends and Applications of Answer Set Programming. 5th Workshop on Trends and Applications of Answer Set Programming, Vienna, Austria.
  • Large-Neighbourhood Search for Optimisation in Answer-Set Solving (Extended Abstract) / Eiter, T., Geibinger, T., Higuera Ruiz, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). Large-Neighbourhood Search for Optimisation in Answer-Set Solving (Extended Abstract). In Proceedings of the 38th International Conference on Logic Programming. 38th International Conference on Logic Programming, Haifa, Israel. Open Publishing Association. http://hdl.handle.net/20.500.12708/139851
  • A System for Automated Industrial Test Laboratory Scheduling / Danzinger, P., Geibinger, T., Janneau, D., Mischek, F., Musliu, N., & Poschalko, C. (2022). A System for Automated Industrial Test Laboratory Scheduling. ACM Transactions on Intelligent Systems and Technology. https://doi.org/10.1145/3546871
  • Investigating Hyper-heuristics for Real-World Test Laboratory Scheduling / Mischek, F., & Musliu, N. (2022, July 0). Investigating Hyper-heuristics for Real-World Test Laboratory Scheduling [Conference Presentation]. EURO 2022, Espoo, Finland.
  • Reinforcement Learning for Cross-Domain Hyper-Heuristics / Mischek, F., & Musliu, N. (2022). Reinforcement Learning for Cross-Domain Hyper-Heuristics. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22) (pp. 4793–4799). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/664
  • An Open Challenge for Exact Job Scheduling with Reticle Batching in Photolithography / Eiter, T., Geibinger, T., Gisbrecht, A., Higuera Ruiz, N. N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). An Open Challenge for Exact Job Scheduling with Reticle Batching in Photolithography. In KEPS 2022 Workshop on Knowledge Engineering for Planning and Scheduling. Workshop on Knowledge Engineering for Planning and Scheduling, International. http://hdl.handle.net/20.500.12708/139763
  • Hyper-Heuristics for Personnel Scheduling Domains / Kletzander, L., & Musliu, N. (2022). Hyper-Heuristics for Personnel Scheduling Domains. In Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (pp. 462–470). AAAI Press. https://doi.org/10.1609/icaps.v32i1.19832
    Project: ARTIS (2017–2024)
  • Exact and meta-heuristic approaches for the production leveling problem / Vass, J., Lackner, M.-L., Mrkvicka, C., Musliu, N., & Winter, F. (2022). Exact and meta-heuristic approaches for the production leveling problem. Journal of Scheduling, 25(3), 339–370. https://doi.org/10.1007/s10951-022-00721-1
    Download: PDF (1.5 MB)
    Project: ARTIS (2017–2024)
  • An Investigation of Hyper-Heuristic Approaches for Teeth Scheduling / Winter, F., & Musliu, N. (2022). An Investigation of Hyper-Heuristic Approaches for Teeth Scheduling. In MIC 2022: 14th Metaheuristics International Conference. 14th Metaheuristics International Conference (MIC 2022), Ortigia-Syracuse, Italy. Springer.
    Project: ARTIS (2017–2024)
  • ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser / Eiter, T., Geibinger, T., Higuera, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser. In G. Kern-Isberner, G. Lackemeyer, & T. Meyer (Eds.), Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning — Applications and Systems (pp. 565–569). IJCAI Organization. https://doi.org/10.24963/kr.2022/58
  • Modeling and Solving the K-track Assignment Problem / Preininger, J., Winter, F., & Musliu, N. (2022). Modeling and Solving the K-track Assignment Problem. In 14th Metaheuristics International Conference. MIC 2022 - 14th Metaheuristics International Conference, Ortigia-Syracuse, Italy. Springer. http://hdl.handle.net/20.500.12708/142199
    Project: ARTIS (2017–2024)
  • A Hybrid Approach for Paint Shop Scheduling in the Automotive Supply Industry / Winter, F., & Musliu, N. (2022). A Hybrid Approach for Paint Shop Scheduling in the Automotive Supply Industry. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 317–320). http://hdl.handle.net/20.500.12708/142193
    Project: ARTIS (2017–2024)
  • Solving the Production Leveling Problem with Order-Splitting and Resource Constraints / Vass, J., Musliu, N., & Winter, F. (2022). Solving the Production Leveling Problem with Order-Splitting and Resource Constraints. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 261–284). http://hdl.handle.net/20.500.12708/142211
    Project: ARTIS (2017–2024)
  • Solving an Industrial Oven Scheduling Problem with a Simulated Annealing Approach / Lackner, M.-L., Musliu, N., & Winter, F. (2022). Solving an Industrial Oven Scheduling Problem with a Simulated Annealing Approach. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 115–120). http://hdl.handle.net/20.500.12708/142210
    Project: ARTIS (2017–2024)

2021

2020

2019

  • Solving the Torpedo Scheduling Problem / Geiger, M. J., Kletzander, L., & Musliu, N. (2019). Solving the Torpedo Scheduling Problem. Journal of Artificial Intelligence Research, 66, 1–32. https://doi.org/10.1613/jair.1.11303
    Project: ARTIS (2017–2024)
  • Modeling and solving staff scheduling with partial weighted maxSAT / Demirovic, E., Musliu, N., & Winter, F. (2019). Modeling and solving staff scheduling with partial weighted maxSAT. Annals of Operations Research, 275(1), 79–99. https://doi.org/10.1007/s10479-017-2693-y
  • Solution Approaches for an Automotive Paint Shop Scheduling Problem / Winter, F., Musliu, N., Mrkvicka, C., & Demirovic, E. (2019). Solution Approaches for an Automotive Paint Shop Scheduling Problem. In Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, {ICAPS} 2019 (pp. 573–581). AAAI Press. http://hdl.handle.net/20.500.12708/57874
    Project: ARTIS (2017–2024)
  • Integer programming model extensions for a multi-stage nurse rostering problem / Mischek, F., & Musliu, N. (2019). Integer programming model extensions for a multi-stage nurse rostering problem. Annals of Operations Research. https://doi.org/10.1007/s10479-017-2623-z
    Project: ARTIS (2017–2024)
  • Exact Methods for a Paint Shop Scheduling Problem from the Automotive Supply Industry / Winter, F., & Musliu, N. (2019). Exact Methods for a Paint Shop Scheduling Problem from the Automotive Supply Industry. CPAIOR 2019 - 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research, Thessaloniki, Greece, EU. http://hdl.handle.net/20.500.12708/86907
    Project: ARTIS (2017–2024)
  • Instance Space Analysis for a Personnel Scheduling Problem / Kletzander, L., Musliu, N., & Smith-Miles, K. (2019). Instance Space Analysis for a Personnel Scheduling Problem. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, {IJCAI} 2019 (pp. 1–8). http://hdl.handle.net/20.500.12708/57880
    Project: ARTIS (2017–2024)
  • Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling / Geibinger, T., Mischek, F., & Musliu, N. (2019). Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 304–319). Springer. https://doi.org/10.1007/978-3-030-19212-9_20
    Project: ARTIS (2017–2024)
  • Exact Methods for Extended Rotating Workforce Scheduling Problems / Kletzander, L., Musliu, N., Gärtner, J., Krennwallner, J., & Schafhauser, W. (2019). Exact Methods for Extended Rotating Workforce Scheduling Problems. In Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, {ICAPS} 2018, Berkeley, CA, USA, July 11-15, 2019 (pp. 519–527). AAAI Press. http://hdl.handle.net/20.500.12708/57873
    Project: ARTIS (2017–2024)
  • Modelling and Solving the Minimum Shift Design Problem / Kletzander, L., & Musliu, N. (2019). Modelling and Solving the Minimum Shift Design Problem. In Lecture Notes in Computer Science. CPAIOR 2019 - 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research, Thessaloniki, Greece, EU. Springer. https://doi.org/10.1007/978-3-030-19212-9
    Project: ARTIS (2017–2024)

2018

  • Min-conflicts heuristic for multi-mode resource-constrained projects scheduling / Musliu, N., & Ahmeti, A. (2018). Min-conflicts heuristic for multi-mode resource-constrained projects scheduling. In Proceedings of the Genetic and Evolutionary Computation Conference. GECCO: Genetic and Evolutionary Computation Conference, Seattle, Non-EU. ACM. https://doi.org/10.1145/3205455.3205620
    Project: ARTIS (2017–2024)
  • Solving the General Employee Scheduling Problem / Kletzander, L., & Musliu, N. (2018). Solving the General Employee Scheduling Problem. In 12th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2018 (pp. 1–36). http://hdl.handle.net/20.500.12708/57573
    Project: ARTIS (2017–2024)
  • A Local Search Framework for Industrial Test Laboratory Scheduling / Mischek, F., & Musliu, N. (2018). A Local Search Framework for Industrial Test Laboratory Scheduling. In Proceedings of the 12th International Conference on the Practice and Theory of Auto­mated Timetabling (PATAT-2018) (pp. 465–467). http://hdl.handle.net/20.500.12708/57572
    Project: ARTIS (2017–2024)
  • Solver Independent Rotating Workforce Scheduling / Musliu, N., Schutt, A., & Stuckey, P. J. (2018). Solver Independent Rotating Workforce Scheduling. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 429–445). Springer. https://doi.org/10.1007/978-3-319-93031-2_31
    Project: ARTE (2012–2017)
  • Modeling and Solving an Automotive Paint Shop Scheduling Problem / Winter, F., Musliu, N., Demirovic, E., & Mrkvicka, C. (2018). Modeling and Solving an Automotive Paint Shop Scheduling Problem. In 12th International Conference on the Practice and Theory of Automated Timetabling (pp. 477–480). http://hdl.handle.net/20.500.12708/57476
    Project: ARTIS (2017–2024)
  • Solution-Based Phase Saving and MaxSAT for Employee Scheduling: A Computational Study / Winter, F., Musliu, N., Demirovic, E., & Stuckey, P. J. (2018). Solution-Based Phase Saving and MaxSAT for Employee Scheduling: A Computational Study. In 12th International Conference on the Practice and Theory of Automated Timetabling (pp. 453–457). http://hdl.handle.net/20.500.12708/57475
    Project: ARTIS (2017–2024)
  • Paint Shop Scheduling in the Automotive Supply Industry / Winter, F., Musliu, N., Demirovic, E., & Mrkvicka, C. (2018). Paint Shop Scheduling in the Automotive Supply Industry. In 29th European Conference on Operational Research (p. 161). http://hdl.handle.net/20.500.12708/57470
    Project: ARTIS (2017–2024)

2017

2016

2015

  • Shift Design with Answer Set Programming / Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In D. Inclezan & M. Maratea (Eds.), 8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015 (p. 13). http://hdl.handle.net/20.500.12708/56218
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / Dusberger, F., Abseher, M., Musliu, N., & Woltran, S. (2015). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. In Q. Yang & M. Wooldridge (Eds.), Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence (pp. 275–282). AAAI Press. http://hdl.handle.net/20.500.12708/56206
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • Shift Design with Answer Set Programming / Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In F. Calimeri, G. Ianni, & M. Truszczynski (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 32–39). Springer. https://doi.org/10.1007/978-3-319-23264-5_4
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • Metaheuristic Algorithms and Tree Decomposition / Hammerl, T., Musliu, N., & Schafhauser, W. (2015). Metaheuristic Algorithms and Tree Decomposition. In J. Kacprzyk & W. Pedrycz (Eds.), Springer Handbook of Computational Intelligence (pp. 1255–1270). Springer. https://doi.org/10.1007/978-3-662-43505-2_64
    Project: ARTE (2012–2017)

2014

2013

  • Automated Test Case Generation in End-User Programming / Musliu, N., Slany, W., & Gärtner, J. (2013). Automated Test Case Generation in End-User Programming. In End-User Development (pp. 272–277). Springer. http://hdl.handle.net/20.500.12708/55075
  • Automated Shift Design and Break Scheduling / Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2013). Automated Shift Design and Break Scheduling. In Automated Scheduling and Planning, Studies in Computational Intelligence Volume 505 (pp. 109–127). Springer. http://hdl.handle.net/20.500.12708/28216
    Project: ARTE (2012–2017)
  • Scheduling of electric vehicle charging operations / Bucar, D., Bessler, S., Musliu, N., & Grønbæk, J. (2013). Scheduling of electric vehicle charging operations. In Proceedings of MISTA 2013- Multidisciplinary International Scheduling Conference: Theory and Applications (pp. 1–13). http://hdl.handle.net/20.500.12708/55080
    Project: ARTE (2012–2017)
  • Algorithm Selection for the Graph Coloring Problem / Musliu, N., & Schwengerer, M. (2013). Algorithm Selection for the Graph Coloring Problem. In Learning and Intelligent Optimization, 7th International Conference, LION 7 (pp. 389–403). Srringer. http://hdl.handle.net/20.500.12708/55073
    Project: ARTE (2012–2017)
  • Applying Machine Learning for Solver Selection in Scheduling / Musliu, N. (2013). Applying Machine Learning for Solver Selection in Scheduling. In Proceedings of the 10th Metaheuristic International Conference (MIC 2013) (pp. 240–242). http://hdl.handle.net/20.500.12708/55072
    Project: ARTE (2012–2017)
  • Analyzing the Features of Employee Scheduling Problems (abstract) / Musliu, N. (2013). Analyzing the Features of Employee Scheduling Problems (abstract). In XXVI EURO - INFORMS Joint International Conference, Abstracts (p. 1). http://hdl.handle.net/20.500.12708/55081

2012

2011

2010

  • A hybrid LS-CP solver for the shifts and breaks design problem / Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2010). A hybrid LS-CP solver for the shifts and breaks design problem. In Proceedings of PATAT 2010 - The 8th International Conference on the Practice and Theory of Automated Timetabling (p. 3). http://hdl.handle.net/20.500.12708/53591
  • A hybrid LS-CP solver for the shifts and breaks design problem / Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2010). A hybrid LS-CP solver for the shifts and breaks design problem. In Proceedings of 7th International Workshop on Hybrid Metaheuristics (pp. 46–61). Lecture Notes in Computer Sciences. http://hdl.handle.net/20.500.12708/53204
  • A Break Scheduling System for Supervision Personnel Using AI techniques. / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2010). A Break Scheduling System for Supervision Personnel Using AI techniques. IEEE Intelligent Systems, 25(2), 60–73. http://hdl.handle.net/20.500.12708/165999
  • An improved memetic algorithm for break scheduling / Widl, M., & Musliu, N. (2010). An improved memetic algorithm for break scheduling. In Proceddings of 7th International Workshop on Hybrid Metaheuristics (pp. 133–147). Lecture Notes in Computer Sciences. http://hdl.handle.net/20.500.12708/53207
  • Scheduling content multicast trees with minimal repetitions / Bessler, S., Lang, L. F., & Musliu, N. (2010). Scheduling content multicast trees with minimal repetitions. In 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). Networks 2010, Warsaw, Poland, EU. https://doi.org/10.1109/netwks.2010.5624910
  • Ant Colony Optimization for Tree Decompositions / Hammerl, T., & Musliu, N. (2010). Ant Colony Optimization for Tree Decompositions. In Evolutionary Computation in Combinatorial Optimization, 10th European Conference, EvoCOP 2010, Proceedings (pp. 95–106). Lecture Notes in Computer Science, Springer. http://hdl.handle.net/20.500.12708/53205

2009

  • Testing while modelling staff scheduling problems / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2009). Testing while modelling staff scheduling problems. In 23rd EUROPEAN CONFERENCE ON OPERATIONAL RESEARCH, BOOK OF ABSTRACTS (p. 198). http://hdl.handle.net/20.500.12708/52811
    Project: Softnet (2006–2011)
  • Temple - a language for staff scheduling problems / Schafhauser, W., Beer, A., Gärtner, J., Musliu, N., & Slany, W. (2009). Temple - a language for staff scheduling problems. In 23rd EUROPEAN CONFERENCE ON OPERATIONAL RESEARCH, BOOK OF ABSTRACTS (p. 198). http://hdl.handle.net/20.500.12708/52810
    Project: Softnet (2006–2011)
  • Local Search for Shift and Break Scheduling / Musliu, N., Beer, A., Gärtner, J., Schafhauser, W., & Slany, W. (2009). Local Search for Shift and Break Scheduling. In 23rd EUROPEAN CONFERENCE ON OPERATIONAL RESEARCH, BOOK OF ABSTRACTS (p. 102). http://hdl.handle.net/20.500.12708/52809
    Project: Softnet (2006–2011)
  • TEMPLE - A Modeling Language for Resource Planning and Scheduling Problems / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2009). TEMPLE - A Modeling Language for Resource Planning and Scheduling Problems (DBAI-TR-2009-65). http://hdl.handle.net/20.500.12708/35721
  • A Memetic Algorithm for a Break Scheduling Problem / Musliu, N., Schafhauser, W., & Widl, M. (2009). A Memetic Algorithm for a Break Scheduling Problem. In Cd Mic 2009 (p. 10). http://hdl.handle.net/20.500.12708/52808
    Project: Softnet (2006–2011)

2008

  • Scheduling Breaks in Shift Plans for Call Centers / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2008). Scheduling Breaks in Shift Plans for Call Centers. In Proceedings of PATAT 2008 - The 7th International Conference on the Practice and Theory of Automated Timetabling (p. 17). http://hdl.handle.net/20.500.12708/52274
  • An Iterated Local Search Algorithm for a Real-Life Break Scheduling Problem / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2008). An Iterated Local Search Algorithm for a Real-Life Break Scheduling Problem. Matheuristics2008 - Second International Workshop on Model Based Metaheuristics, Bertinoro, Italien, EU. http://hdl.handle.net/20.500.12708/84743
  • Heuristic Methods for Hypertree Decomposition / Dermaku, A., Ganzow, T., Gottlob, G., McMahan, B. J., Musliu, N., & Samer, M. (2008). Heuristic Methods for Hypertree Decomposition. In Lecture Notes in Computer Scienc, MICAI 2008: Advances in Artificial Intelligence (pp. 1–11). Springer. http://hdl.handle.net/20.500.12708/52378
  • Solving the Social Golfer Problem with a GRASP / Triska, M., & Musliu, N. (2008). Solving the Social Golfer Problem with a GRASP. In In Proceedings of PATAT 2008 - The 7th International Conference on the Practice and Theory of Automated Timetabling (p. 12). http://hdl.handle.net/20.500.12708/52343
  • An Improved SAT Formulation for the Social Golfer Problem / Triska, M., & Musliu, N. (2008). An Improved SAT Formulation for the Social Golfer Problem. In Proceedings of PATAT 2008 - The 7th International Conference on the Practice and Theory of Automated Timetabling (p. 13). http://hdl.handle.net/20.500.12708/52280
  • An Iterative Heuristic Algorithm for Tree Decomposition / Musliu, N. (2008). An Iterative Heuristic Algorithm for Tree Decomposition. In C. Cotta & J. I. van Hemert (Eds.), Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence, Volume 153/2008 (pp. 133–150). Springer. http://hdl.handle.net/20.500.12708/26169

2007

  • Genetic algorithms for generalized hypertree decompositions / Musliu, N., & Schafhauser, W. (2007). Genetic algorithms for generalized hypertree decompositions. European Journal of Industrial Engineering, 1(3), 317–340. http://hdl.handle.net/20.500.12708/169638
    Project: Hypertree (2004–2006)
  • The Minimum Shift Design Problem / Di Gaspero, L., Gärtner, J., Kortsarz, G., Musliu, N., Schaerf, A., & Slany, W. (2007). The Minimum Shift Design Problem. Annals of Operations Research, 155(1), 79–105. http://hdl.handle.net/20.500.12708/169640
  • Iterated Local Search for Cyclic Staff Scheduling / Musliu, N. (2007). Iterated Local Search for Cyclic Staff Scheduling. In EURO XXII: 22nd European Conference on Operational Research (Book of Abstracts) (p. 143). http://hdl.handle.net/20.500.12708/51824
    Project: Softnet (2006–2011)
  • Tabu Search for Generalized Hypertree Decompositions / Musliu, N. (2007). Tabu Search for Generalized Hypertree Decompositions. In MIC 2007: The Seventh Metaheuristics International Conference (p. 3). http://hdl.handle.net/20.500.12708/51823
    Project: Hypertree (2004–2006)
  • Generation of Tree Decompositions by Iterated Local Search / Musliu, N. (2007). Generation of Tree Decompositions by Iterated Local Search. In Proceedings of the Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation, EvoCOP 2007, LNCS, Volume 4446 (pp. 130–141). http://hdl.handle.net/20.500.12708/51799
    Project: Hypertree (2004–2006)

2006

2005

  • Combination of Local Search Strategies for Rotating Workforce Scheduling Problem / Musliu, N. (2005). Combination of Local Search Strategies for Rotating Workforce Scheduling Problem. In IJCAI-05 Proceedings (pp. 1529–1530). Professional Book Center. http://hdl.handle.net/20.500.12708/51045
  • Min Conflicts Based Heuristics for Rotating Workforce Scheduling Problem / Musliu, N. (2005). Min Conflicts Based Heuristics for Rotating Workforce Scheduling Problem. In Proceedings of the 6th Metaheuristics International Conference (p. 6). http://hdl.handle.net/20.500.12708/51027
  • Hypertree Decompositions: Structure, Algorithms, and Applications / Gottlob, G., Grohe, M., Musliu, N., Samer, M., & Scarcello, F. (2005). Hypertree Decompositions: Structure, Algorithms, and Applications. In D. Kratsch (Ed.), Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (pp. 1–15). Springer-Verlag Berlin Heidelberg. http://hdl.handle.net/20.500.12708/51014
    Project: Hypertree (2004–2006)
  • Theory and Practice of the Minimum Shift Design Problem / Di Gaspero, L., Gärtner, J., Kortsarz, G., Musliu, N., Schaerf, A., & Slany, W. (2005). Theory and Practice of the Minimum Shift Design Problem. In In Metaheuristics: Progress as Real Problem Solvers, Ibaraki, Toshihide; Nonobe, Koji; Yagiura, Mutsunori (Eds.) (pp. 159–180). Springer. http://hdl.handle.net/20.500.12708/25353

2004

  • A Heuristic Based System for Generation of Shifts with Breaks / Gärtner, J., Musliu, N., & Slany, W. (2004). A Heuristic Based System for Generation of Shifts with Breaks. In Proceedings of the Twenty-fourth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (pp. 95–106). Springer. http://hdl.handle.net/20.500.12708/50981

2001

 

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

  • Memetic algorithms for tree decomposition / Bader, K. (2014). Memetic algorithms for tree decomposition [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.23717
    Download: PDF (1.88 MB)

2013

2012

2011

2010

2009

2008

2006

 

  • Best Industry and Applications Track Paper Award
    2022 / ICAPS 2022 / Singapore / Website
  • Best Practices in Education Award
    2019 / Informatics Europe / Switzerland / Website
  • Distinguished student (Student i dalluar) award from the University of Prishtina, Kosova.
    1995 / University of Prishitna / Kosovo

Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.

Until then, please visit Nysret Musliu’s research profile in TISS .