Faculty of Informatics logo Advanced Planning and Scheduling
- - - - -
Funding: Grant Agency of Czech Republic, Project No. GA201/01/0942
Starting Date: January 1, 2001
Duration: 3 years
Coordinator: Roman Bartak (Charles University)
Project Leader at FI: Hana Rudova (FI)
- - - - -
Description The aim of the project is to gain a deeper understanding of modelling and solving real-world planning and scheduling problems, and to bring researches from different areas (constraint and logic programming, operations research, and parallel algorithms) and institutions (Charles University, Masaryk University) to co-operate on solving these problems.

In particular, we plan to propose generic models for planning and scheduling problems based on real-world problems, like planning and scheduling in complex process environments, metacomputing scheduling, and timetabling, and to design solving algorithms for these models using technology sharing between constraint programming, artificial intelligence, and operations research. Last but not least we plan to improve the efficiency of the proposed algorithms by using a multi-agent technology and parallel implementations.

- - - - -
Cooperating
Organisation
Faculty of Mathematics and Physics , Charles University
Faculty of Informatics, Masaryk University
- - - - -
Publications
  • Roman Bartak Theory and Practice of Constraint Propagation. In Proceedings of CPDC2001 Workshop (invited talk), pages 7-14, Gliwice, June 2001.
  • Roman Bartak Dynamic Global Constraints: A First View. In Krzysztof R. Apt, Roman Bartak, Eric Monfroy, Francesca Rossi, editors, Proceedings of the 2001 ERCIM Workshop on Constraints. Prague, Czech Republic, June 2001.
    PostScript.
  • Roman Bartak Filtering Algorithms for Tabular Constraints. In Proceedings of CP2001 Workshop CICLOPS, Paphos, Cyprus, December 2001.
  • Roman Bartak Dynamic Global Constraints in Constraint Logic Programming. ITI Series 2001-018, Prague 2001.
  • Roman Bartak, Hana Rudova, Integrated Modelling for Planning, Scheduling, and Timetabling Problems . In Proceedings of the Twentieth Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2001). Edinburgh (UK) : Old College, University of Edinburgh, 2001, pages 19-31.
  • Ondrej Cepek, M. Okada, M.Vlach, Nonpreemptive Flowshop Scheduling with Machine Dominance. Accepted to European Journal of Operational Research.
  • Ondrej Cepek, A simple heuristic for knowledge base compression. Accepted to Central European Journal of Operational Research.
  • Ondrej Cepek, Discovering Redundant Variables in a Knowledge Base. In Proceedings of the 3rd Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty, March 2001, pages 32-136.
  • Ondrej Cepek, Generalizations of Horn formulae and their mutual relationship. In Proceedings of the 4th Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty, September 2001, pages 3-20.
  • Tomas Muller, Roman Bartak Interactive Timetabling. In Krzysztof R. Apt, Roman Bartak, Eric Monfroy, Francesca Rossi, editors, Proceedings of the 2001 ERCIM Workshop on Constraints. Prague, Czech Republic, June 2001.
    PostScript.
  • Hana Rudova, Soft Scheduling. In Krzysztof R. Apt, Roman Bartak, Eric Monfroy, Francesca Rossi, editors, Proceedings of the 2001 ERCIM Workshop on Constraints. Prague, Czech Republic, June 2001.
    CoRR link, PostScript, Abstract, BibTeX.
- - - - -
Contact Hana Rudova
- - - - -
People Roman Bartak (Charles University)
Ondrej Cepek (Charles University)
Petr Gregor (Charles University)
Jan Hruza (Charles University)
Roman Mecl (Charles University)
Petr Stepanek (Charles University)
Hana Rudova (FI)
- - - - -
Links
- - - - -
- - - - -
webmaster@informatics.muni.cz