Mirësevini (Welcome)	Priv.-Doz. Dr. Nysret Musliu Tel.: (+43)-1-58801 58428 Email: musliu@dbai.tuwien.ac.at Database and Artificial Intelligence Group Vienna University of Technology
Research Publications Teaching Students Software/Benchmark Problems
I am currently Priv. Dozent (roughly equivalent to the American Associate Professor title) in the Database and Artificial Intelligence Group, Vienna University of Technology. I obtained in 1996 the degree 'inxhinier i diplomuar' (equivalent with Dipl.-Ing, master's degree) in the Faculty of Electrical Engineering (field of computer sciences and telecommunications), University of Prishtina, Kosova. I received my Ph.D. in Computer Science from Vienna University of Technology in October 2001 (download thesis ). In October 2007 I finished my Habilitation (professorial qualification) in area of Applied Computer Sciences at the Vienna University of Technology.
Research Research Interests Problem Solving and Search in Artificial Intelligence Meta-heuristic algorithms (including local search, tabu search, simulated annealing, iterated local search, greedy algorithms, and nature-inspired strategies such as genetic algorithms and ant colony optimization). (Selected papers given in section publications: ([J4], [J5], [J6], [BC1], [BC2], [A3], [J11], [C34]) Application of machine learning techniques in problem solving ([C40]) Constraint programming techniques (techniques based on pruning of search tree and constraint propagation) ([J3], [C20], [A2], [C33]) Graph and hypergraph decomposition methods (tree and hypertree decompositions) and their application. ([C13], [BC1], [C24], [C30], [C37]) Hybrid techniques ([J7], [J5], [C6], [C34]) Applications Scheduling (cyclic staff scheduling, shift scheduling, break scheduling) ([J3], [J4], [C23], [BC1], [C33], [C34], [J9]) Timetabling (social golfer problem) ([J9], [10]) Other combinatorial optimizations problems (e.g. set covering) ([C15]) Development of scheduling systems and software tools for constraint solving ([J11], [C10], [C38] and ongoing work in project “Planning Knowledge”) Research Projects Softnet Austria 2 (2010-2013) - Competence Network in Next Generation Soft-ware Engineering: Project 6: Test Support for End-User Programming. Responsibilities: Local project leader at the Vienna University of Technology. Planning Knowledge (2007-2010): Project of Softnet Austria - industrial competence network within K-net program of the Austrian Federal Ministry of Economics and Labor. Responsibilities: Local project leader at the Vienna University of Technology. Hypertree Decompositions (2004 - 2006): Research project of DBAI group supported by FWF A Heuristic based system for generation of shifts with breaks (2003): Research project between DBAI and Ximes Corp., supported by WIFI Wien Operating Hours Assistant (2000-2003): Joint project between DBAI and Ximes Corp., supported by FFF First Class Scheduler (1998-2002): Joint project between DBAI and Ximes Corp., supported by FFF Professional Activities Programme Committee member of IJCAI 2011 - Twenty-Second International Joint Conference on Artificial Intelligence, Barcelona, Spain, July 16-22, 2011. Programme Committee member of GECCO 2012 - the Genetic & Evolutionary Computation Conference (Combinatorial Optimization and Metaheuristics track), Philadelphia, USA, July 07-11, 2012. Programme Committee member of EvoCOP 2012 - 11th European Conference on Evolutionary Computation in Combinatorial Optimisation, 11-13 April 2011, Malaga, Spain. Programme Committee member of GECCO 2011 - the Genetic & Evolutionary Computation Conference (Combinatorial Optimization and Metaheuristics track), Dublin, Irland, July 12-16, 2011. Programme Committee member of CISched 2011- IEEE Symposium on Computational Intelligence in Scheduling, April 11-15, 2011 - Paris, France. Programme Committee member of EvoCOP 2011 - 11th European Conference on Evolutionary Computation in Combinatorial Optimisation, 27th - 29th April, 2011, Torino, Italy. Programme Committee member of MIC 2011- The 9th Metaheuristic International Conference, July 25-28, 2011, Udine, Italy. Programme Committee member of ICAART 2011- 3rd International Conference on Agents and Artificial Intelligence, January 28-30, Rome, Italy. Programme Committee member of GECCO 2010 - the Genetic & Evolutionary Computation Conference (Combinatorial Optimization and Metaheuristics track), Portland, USA, July 7-11, 2010. Programme Committee member of HM 2010 - 7th International Workshop on Hybrid Metaheuristics, Vienna, Austria, October 1-2, 2010. Programme Committee member of EvoCOP 2010 - 10th European Conference on Evolutionary Computation in Combinatorial Optimisation, 7th - 9th April, 2010, Istanbul Technical University, Istanbul, Turkey. Programme Committee member of GECCO 2009 - the Genetic & Evolutionary Computation Conference (Combinatorial Optimization and Metaheuristics track), Montreal, Canada, July 8-12, 2009. Programme Committee member of HM2009 - 6th International Workshop on Hybrid Metaheuristics, Udine, Italy, October 16-17, 2009. Programme Committee member of 2009 IEEE Symposium on Computational Intelligence in Scheduling, Nashville, USA, March 30 – April 2, 2009 Programme Committee member of EvoCOP 2009 - 9th European Conference on Evolutionary Computation in Combinatorial Optimisation, Tübingen, Germany, 15-17 April 2009. Programme Committee member of ICEC 2009 -International Conference on Evolutionary Computation, Madeira, Portugal, 5 - 8 October, 2009. Programme Committee member of EvoCOP 2008 - Eighth European Conference on Evolutionary Computation in Combinatorial Optimisation, Napoli, Italy, 26-28 March, 2008 Programme Committee member of the Twelfth IASTED International Conference on Artificial Intelligence and Soft Computing (ASC 2008), Palma de Mallorca, Spain, September 1-3, 2008 Programme Committee member of 2007 IEEE Symposium on Computational Intelligence in Scheduling, Honolulu, Hawaii, April 1-5, 2007 Scientific Committee member of the 8th EU/MEeting on Metaheuristics in the Service Industry 04.10.2007-05.10.2007, Stuttgart, Germany Programme Committee member of the The 2007 International Conference of Computational Intelligence and Intelligent Systems, London, U.K., 2-4 July 2007 Programme Committee member of The 2007 IAENG International Conference on Artificial Intelligence and Applications, Hong Kong, 21-23 March, 2007 Programme Committee member of the International MultiConference of Engineers and Computer Scientists 2006 (IAENG International Workshop on Artificial Intelligence and Applications), Hong Kong, 20-22 June, 2006 Co-organiser of the Workshop on Graph and Hypergraph Decompositions-Methods and Applications in Computer Science, 2004, Vienna, Austria Co-organiser and Programme Committee member of the 4th EU/ME Workshop: Design and Evaluation of Advanced Hybrid Meta-heuristics, 2004, Nottingham, UK Guest co-editor (with Jens Gottlieb, Dario Landa-Silva and Eric Soubeiga) of cluster in Volume 7, Number 1 of Journal of Mathematical Modelling and Algorithms (JMMA), 2008 External reviewer for these Journals and Conferences: IEEE Transactions on Parallel and Distributed Systems, Journal of Artificial Evolution and Applications, European Journal of Operational Research, Annals of Operational Research, Journal of Scheduling, Artificial Intelligence Communications, Theory of Computing Systems, Computers and Operations Research, Computers & Combinatorial Optimization, INFORMS Journal on Computing, International Journal of Computational Intelligence Research, Computers & Industrial Engineering, Memetic Computing , PATAT’2000, PATAT’2002, KBCS-2004, ECAI-2004, EU/ME Workshop 2004, MIC 2005.
Teaching Problem Solving and Search in Artificial Intelligence Machine Learning Past Lectures Seminar aus Artificial Intelligence Seminar für DiplomandInnen Projektpraktikum Seminar (mit Bachelorarbeit) Informatikpraktikum 1 Informatikpraktikum 2 Grundlagen methodischen Arbeitens  AK der AI 2: Problem Solving Techniques in Artificial Intelligence Einführung in die Artificial Intelligence LU Datenbanksysteme Introduction to Artificial Intelligence (Prishtina Summer University), and other guest lectures at the University of Prishtina, Kosova
Students Topics for Master and PhD theses If you are interested to do your master or Ph.D. thesis under my supervision please contact me by email. Possible topics are closely related to my research interests (see also my publications). Ph.D. Students First supervisor for Ph.D. students Werner Schafhauser. TEMPLE - A Domain Specific Language for Modeling and Solving Real-Life Staff Scheduling Problems. Vienna University of Technology, 2007- November 2010 Second evaluator for Ph.D. students Tabbasum Naz. Configurable Meta-search in Human Resource Domain. Vienna University of Technology, 2005 – 06/2009 Shariq Bashir. Evaluating Retrieval Models using Retrievability Measurement. Vienna University of Technology, November 2011 Current Ph.D. students Markus Triska, Correctness Considerations in Constraint Solving over Finite Domains, 2008 – Florian Wisser, AI for the Card Game Schnapsen, 2009- Supervised Master theses Andreas Lehrbaum. A New Hyperheuristic Algorithm for Cross-Domain Search Problems. Vienna University of Technology 2011. Lam Tung Nguyen. An Efficient Algorithm for Phylogeny Reconstruction by Maximum Likelihood, Vienna University of Technology, 2011. (co-supervised with Arndt von Haeseler) Magdalena Widl. Memetic Algorithms for Break Scheduling. Master Thesis, Vienna University of Technology, 2010. (Winner of the “Distinguished Young Alumnus/Alumna”-Award for the best master thesis finished in Summer Semester 2010 at the Faculty of Informatics, Vienna University of Technology) Thomas Hammerl. Ant Colony Optimization for Tree and Hypertree Decompositions. Master Thesis, Vienna University of Technology, 2009. Markus Triska. Solution Methods for the Social Golfer Problem, Master Thesis, Vienna University of Technology, 2008. (Winner of the “Distinguished Young Alumnus/Alumna”-Award and the Microsoft Price for the best master thesis finished in Summer Semester 2008 at the Faculty of Informatics, Vienna University of Technology) Ekaterina Lebedeva. Hypertree Decompositions for Optimal Winner Determination in Combinatorial Auctions, Master Thesis, Vienna University of Technology, 2008. (co-supervised with Georg Gottlob and Werner Schafhauser) Artan Dermaku. Generalized Hypertree Decomposition based on Hypergraph Partitioning, Diploma Thesis, Vienna University of Technology, 2007. (co-supervised with Georg Gottlob) Michael Mörz. A new Tabu Search Framework and it's Application, Diploma Thesis, Vienna University of Technology, 2007. (co-supervised with Georg Gottlob) Werner Schafhauser. New Heuristic Methods for Tree Decompositions and Generalized Hypertree Decompositions, Master Thesis, Vienna University of Technology, 2006. (co-supervised with Georg Gottlob) (Selected among best 5 master theses finished in Winter Semester 2006/2007 at the Faculty of Informatics, Vienna University of Technology) Master theses below were supervised by Fang Wei, and I served as a co-supervisor after she moved to the University of Freiburg: Lee Mei Sin. Data Mining on Empty Result Queries. Master Thesis, Vienna University of Technology, 2008. E. Paisios. Generic Programing for Graph Problems Using Tree Decompositions. Master Thesis, Vienna University of Technology, 2008. Ongoing master theses Bong Min Kim. New algorithms for the Traveling Tournament Problem. Vienna University of Technology 2010 – Martin Schwengerer. Algorithm Selection for Graph Coloring. Vienna University of Technology 2011 –
Publications Refereed Journal Articles [J11] Andreas Beer, Johannes Gärtner, Nysret Musliu, Werner Schafhauser, Wolfgang Slany. An AI-based break-scheduling system for supervisory personnel. IEEE Intelligent Systems, 25(2):60-73, 2010. [J10] Markus Triska, Nysret Musliu. An improved SAT formulation for the social golfer problem. Annals of Operational Research, 2010. [J9] Markus Triska, Nysret Musliu. An Effective Greedy Heuristic for the Social Golfer Problem. Annals of Operations Research, accepted for publication, 2011. [J8] Gerhard Post, Jeffrey H. Kingston, Samad Ahmadi, Sophia Daskalaki, Christos Gogos, Jari Kyngas, Cimmo Nurmi, Nysret Musliu, Nelishia Pillay, Haroldo Santos, Andrea Schaerf. XHSTT: an XML archive for high school timetabling problems in different countries. Annals of Operations Research, accepted for publication, 2011. [J7] Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz Nysret Musliu, Andrea Schaerf and Wolfgang Slany. The Minimum Shift Design Problem. Annals of Operations Research, Volume 155, pp. 79-105, 2007. [J6] Nysret Musliu and Werner Schafhauser. Genetic Algorithms for Generalized Hypertree Decompositions. European Journal of Industrial Engineering, Volume1 No.3, pp. 317-340, 2007. [J5] Nysret Musliu. Heuristic Methods for Automatic Rotating Workforce Scheduling. International Journal of Computational Intelligence Research, Volume 2, Issue 4, pp. 309-326, 2006. [J4] Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. Local Search for Shift Design. European Journal of Operational Research, 153(1), 51-64, 2004. [J3] Nysret Musliu, Johannes Gärtner, Wolfgang Slany. Efficient generation of rotating workforce schedules. Discrete Applied Mathematics, Vol. 118 (1-2), pp. 85-98, 2002. [J2] Ruth Fingerlos, Johannes Gärtner, Nysret Musliu, and Wolfgang Slany. Zyklische Schichtplanung. KI Journal, 2/01:  31-34, 2001. [J1] Johannes Gärtner, Nysret Musliu, and Wolfgang Slany. Rota: A research project on algorithms for workforce scheduling and shift design optimisation. Artificial Intelligence Communications, 14(2): 83-92, 2001. Refereed Book Chapters [BC2] Nysret Musliu. An Iterative Heuristic Algorithm for Tree Decomposition. Studies in Computational Intelligence Springer,Volume 153,pages 133-150, 2008. Carlos Cotta, Jano van Hemert (Eds.). [BC1] Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf and Wolfgang Slany. Theory and Practice of the Minimum Shift Design Problem. In Metaheuristics: Progress as Real Problem Solvers, Springer, 2005. Ibaraki, Toshihide; Nonobe, Koji; Yagiura, Mutsunori (Eds.). Conference and Workshop Publications [C40] Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran. Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. Learning and Intelligent Optimization Conference (LION 6), Paris, Jan 16-20, 2012. [C39] Andreas Lehrbaum, Nysret Musliu. A new Hyperheuristic Algorithm for Cross Domain Search Problems. Learning and Intelligent Optimization Conference (LION 6), Paris, Jan 16-20, 2012. [C38] Johannes Gärtner, Nysret Musliu, Werner Schafhauser, Wolfgang Slany. TEMPLE - A Domain Specific Language for Modeling and Solving Staff Scheduling Problems. Proceedings of IEEE Symposium on Computational Intelligence in Scheduling (CI-Sched 2011), April 11-15, 2011 - Paris, France. [C37] Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran. A New Tree-Decomposition Based Algorithm for Answer Set Programming. The IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Florida, USA, 2011. [C36] Markus Triska, Nysret Musliu. A Constraint Programming Application for Rotating Workforce Scheduling. The Twenty-fourth International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2011), Studies in Computational Intelligence, Volume 363, Springer 2011. [C35] Nysret Musliu. Constructing Cyclic Staff Schedules by Iterated Local Search (extended abstract). The 9th Metaheuristics International Conference (MIC 2011), Udine, Italy, July 25-28, 2011. [C34] M. Widl, N. Musliu. An improved memetic algorithm for break scheduling. HM 2010 - 7th International Workshop on Hybrid Metaheuristics. Lecture Notes in Computer Science, 6373, pages 133-147, Springer, 2010. [C33] L. Di Gaspero, J. Gärtner, N. Musliu, A. Schaerf, W. Schafhauser, and W. Slany. A hybrid LS-CP solver for the shifts and breaks design problem. HM 2010 - 7th International Workshop on Hybrid Metaheuristics. Lecture Notes in Computer Science, 6373, pages 46-61, Springer, 2010. (extended abstract of this paper also appeared in Proceedings of PATAT 2010 - The 8th International Conference on the Practice and Theory of Automated Timetabling, Belfast, August 10 - 13, 2010). [C32] Sandford Bessler, Lukas Lang, Nysret Musliu, Scheduling content multicast trees with minimal repetitions. In Proceedings of Networks 2010 - 14th International telecommunications Network Strategy and Planning Symposium, September 27-30, Warsaw, Poland, 2010. [C31] Werner Schafhauser, Andreas Beer, Johannes Gärtner, Nysret Musliu, Wolfgang Slany. Temple: an end-user language for staff scheduling problems (abstract). Matheuristics 2010 - Third international workshop on model-based metaheuristics, Vienna, 2010. [C30] Thomas Hammerl, Nysret Musliu. Ant Colony Optimization for Tree Decompositions. EvoCOP 2010 – 10th European Conference on Evolutionary Computation in Combinatorial Optimisation, Lecture Notes in Computer Science, Volume 6022, Springer, 2010. [C29] Nysret Musliu, Werner Schafhauser, Magdalen Widl. A Memetic Algorithm for a Break Scheduling Problem. The 8th Metaheuristic International Conference (MIC 2009), Hamburg, Germany, July 13-16, 2009. [C28] Schafhauser, W., A. Beer, N. Musliu, W. Slany, J. Gärtner, and K. Boonstra-Hörwein. Break optimization in shifts (abstract). 19th International Symposium on Shiftwork and Working Time Health and Well-being in the 24-h Society. 2009. San Servolo Island - Venezia, Italy: Working Time Society. [C27] Werner Schafhauser, Andreas Beer, Johannes Gärtner, Nysret Musliu, Wolf-gang Slany. TEMPLE – a language for staff scheduling problems (abstract). EURO 2009 - 23rd European Conference on Operational Research, Bonn, July 5 - 8, 2009. [C26] Nysret Musliu, Andreas Beer, Johannes Gärtner, Werner Schafhauser, Wolf-gang Slany. Local search for shift and break scheduling (abstract). EURO 2009 - 23rd European Conference on Operational Research, Bonn, July 5 - 8, 2009. [C25] Andreas Beer, Johannes Gärtner, Nysret Musliu, Werner Schafhauser and Wolfgang Slany. Testing while modelling staff scheduling problems (abstract). EURO 2009 - 23rd European Conference on Operational Research, Bonn, July 5 - 8, 2009. [C24] Artan Dermaku, Tobias Ganzow, Georg Gottlob, Ben McMahan, Nysret Musliu, Marko Samer. Heuristic Methods for Hypertree Decompositions. MICAI 2008: Advances in Artificial Intelligence, 7th Mexican International Conference on Artificial Intelligence. Lecture Notes in Artificial Intelligence, Volume 5317, pages 1-11, 2008, Springer. [C23] Andreas Beer, Johannes Gärtner, Nysret Musliu, Werner Schafhauser, Wolfgang Slany. 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, Montréal, August 18 - 22, 2008. [C22] Andreas Beer, Johannes Gärtner, Nysret Musliu, Werner Schafhauser, Wolfgang Slany. An Iterated Local Search Algorithm for a Real-Life Break Scheduling Problem (abstract). Matheuristics2008- Second International Workshop on Model Based Metaheuristics, June 16 - 18, 2008, Bertinoro, Italy. [C21] Markus Triska, Nysret Musliu. Solving the Social Golfer Problem with a GRASP. In Proceedings of PATAT 2008 - The 7th International Conference on the Practice and Theory of Automated Timetabling, Montréal, August 18 - 22, 2008. [C20] Markus Triska, Nysret Musliu. 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, Montréal, August 18 - 22, 2008. [C19] Nysret Musliu. Generation of Tree Decompositions by Iterated Local Search. EvoCOP 2007 - Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation, LNCS, Volume 4446, pages 130-141, 2007, Springer. [C18] Nysret Musliu. Tabu Search for Generalized Hypertree Decompositions. The Seventh Metaheuristics International Conference (MIC), Montreal, June 25-29, 2007. [C17] Nysret Musliu. Iterated Local Search for Cyclic Staff Scheduling (abstract of invited presentation). 22nd European Conference on Operational Research EURO XXII, Prague, 2007. [C16] Nysret Musliu. An Iterative Heuristic Algorithm for Tree Decompositions. 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics, University of Málaga, Spain, 16-17 November, 2006. [C15] Nysret Musliu. Local search algorithm for unicost set covering problem, The 19th International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems (IEA/AIE'06), Annecy, FRANCE, 2006 (Lecture Notes in Artificial Intelligence (LNAI),Volume 4031 , pages 302-311, 2006, Springer). [C14] Nysret Musliu. Combination of Local Search Strategies for Rotating Workforce Scheduling Problem (poster), Nineteenth International Joint Conference on Artificial Intelligence (IJCAI- 05), Edinburgh, Scotland, 30 July - 5 August 2005 (also in Workshop on Design and Evaluation of Advanced Hybrid Meta-Heuristics, November 4-5, 2004, Nottingham, UK). [C13] Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, and Francesco Scarcello. Hypertree Decompositions: Structure, Algorithms, and Applications, International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05)", Metz, France, 2005, (Lecture Notes in Computer Science, Volume 3787, pages 1 – 15, 2005, Springer-Verlag Heidelberg). [C12] Nysret Musliu. Min Conflicts Based Heuristics for Rotating Workforce Scheduling Problem. The 6th Metaheuristics International Conference (MIC'05), Vienna, Austria, August 22-26, 2005. [C11] Nysret Musliu. Local Search Strategies for Rotating Workforce Scheduling Problem. Proceedings of the Fourth EU/ME Workshop on Design and Evaluation of Advanced Hybrid Meta-Heuristics, November 4-5, 2004, Nottingham, UK. [C10] Johannes Gärtner, Nysret Musliu, Wolfgang Slany. A Heuristic Based System for Generation of Shifts with Breaks. Applications and Innovations in Intelligent Systems XII: Proceedings of AI-2004, the Twenty-fourth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, pages 95-106, 2005, Springer. [C9] Michael Mörz, Nysret Musliu. Genetic Algorithm for Rotating Workforce Scheduling. Proceedings of second IEEE International Conference on Computational Cybernetics ( pages 121-126) , Vienna, Austria, August 30 – September 1, 2004. [C8] Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz Nysret Musliu, Andrea Schaerf and Wolfgang Slany. The Minimum Shift Design Problem: Theory and Practice. 11th Annual European Symposium on Algorithms, Budapest, 15-20 September, 2003. (Lecture Notes in Computer Science, volume 2832, pages 593 – 604, 2003, Springer-Verlag Heidelberg) [C7] Nysret Musliu. Applying Tabu Search to the Rotating Workforce Scheduling Problem. The 5th Metaheuristics International Conference (MIC'03), Kyoto, Japan, August 25-28, 2003. [C6] Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz Nysret Musliu, Andrea Schaerf and Wolfgang Slany. A hybrid network flow tabu search heuristic for the minimum shift design problem. The 5th Metaheuristics International Conference (MIC'03), Kyoto, Japan, August 25-28, 2003. (Extended Version: In K. Nonobe T. Ibaraki and M. Yagiura, editors, Metaheuristics: Progress as Real Problem Solvers. Kluwer Academic Publishers, 2005) [C5] Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. Local Search for Shift Design. Proceedings of the 4th Metaheuristics International Conference (MIC'01), Porto, Portugal, July 16-20, 2001. [C4] Nysret Musliu, Johannes Gärtner, Wolfgang Slany. Efficient generation of rotating workforce schedules. In Edmund Burke and Wilhem Erben, editors, Proceedings of the 3^rd international conference on the practice and theory of automated timetabling (PATAT 2000), Konstanz, Germany , pages 314-332, August 2000. [C3] Wolfgang Slany, Nysret Musliu, Guy Kortsarz, and Johannes Gärtner. Theory and practice of shift scheduling (invited paper). RIMS Kokyuroku of the Research Institute of Mathematical Sciences, Kyoto University, 1185: 172-181, 2000. [C2] Nysret Musliu, Johannes Gärtner, Wolfgang Slany. Shift scheduling from a combinatorial optimization point of view (abstract). Third Alio-Euro Workshop on Applied Combinatorial Optimization, Erice-Italy, November 1999. [C1] Wahl S., Musliu N., Angelova R., Slany W., Herber G., Janke M. Shiftplanassistant 4.0 - State of development. XIV International Symposium on Night and Shiftwork, 1999 Wiesensteig, Germany. (Also appeared in: Hornberger S, Knauth P, Costa G, Folkard S, editors. Shiftwork in the 21st century: challenges for research and practice.Frankfurt: Peter Lang; 2000. p. 327-32). Academic Writings [A3] Nysret Musliu. Metaheuristics for Scheduling and other Hard Problems. Habilitation Thesis, Technische Universität Wien/Informatik, February 2007. [A2] Nysret Musliu. Intelligent Search Methods for Workforce Scheduling: New Ideas and Practical Applications. PhD thesis, Technische Universität Wien, October 2001. [A1] Nysret Musliu. „Ndërlidhja e Gjuhës Clipper me C“. Diploma thesis, University of Prishtina, July 1996. Technical Reports [TR8] Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran. Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. DBAI-TR-2011-73, Technische Universität Wien, 2011. [TR6] Nysret Musliu, Johannes Gärtner, Wolfgang Slany. Efficient generation of rotating workforce schedules. Technical Report DBAI-TR-2000-35, Technische Universität Wien, 2000. [TR5] Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. Local Search for Shift Design. Technical Report DBAI-TR-2001-45, Technische Universität Wien, 2001.  [TR4] Nysret Musliu. Applying Tabu Search to the Rotating Workforce Scheduling Problem. Technical Report DBAI-TR-2003-49, Technische Universität Wien, 2003/05. [TR3] Tobias Ganzow, Georg Gottlob, Nysret Musliu, Marko Samer. A CSP Hypergraph Library, DBAI-TR-2005-50, Technische Universität Wien, 2005. [TR2] Artan Dermaku, Tobias Ganzow, Georg Gottlob, Ben McMahan, Nysret Musliu, Marko Samer. Heuristic Methods for Hypertree Decompositions, DBAI-TR-2005-53, Technische Universität Wien, 2005. [TR1] Nysret Musliu. An Iterative Heuristic Algorithm for Tree Decomposition. DBAI-TR-2007-56. Technische Universität Wien, 2007.
Software Contribution to Commercial Scheduling Software Packages I have been one of main developers of algorithms in software packages: First Class Scheduler – FCS (part of Shift Plan Assistant (SPA) of Ximes Corp.): This package is internationally recognised software for rotating workforce scheduling, and is licensed and used since 1999 in many companies in Europe. Operating Hours Assistant (OPA 1.0) of Ximes Corp.: This package is used successfully and licensed since year 2000 in different companies in Europe like airports, call centres, hospitals, etc. For generation of shifts with breaks: This software was included in OPA 2.0, and was used from different companies in airports, call centres etc. I have been working on developing of algorithms and object oriented design for RAS (The Representation and Analysis Software): Software of Ximes Corp. for the US Department of Transportation. Hypertree Library Includes several algorithms for generation of hypertree decompositions. I have been working on developing of some algorithms in this library. The algorithms have been evaluated for benchmark examples from the literature and the industry Benchmark Problems Shift Design Problem Includes three different sets of randomly generated examples for the shift design problem Shift Design and Break Scheduling Includes real life and random instances for the shift design and break scheduling problem Rotating Workforce Scheduling Includes 20 benchmark problems for rotating workforce scheduling problem. Example 1-3 appeared earlier in the literature, and other 17 examples are real life problems Hypertree decomposition - CSP Hypergraph Library This collection of problems contains hypergraph representation of several classes of CSP instances. These instances include industrial examples and randomly generated examples. These problems are used for evaluation of hypertree decompositions algorithms
Last modified: 07/2011