russian 
english 

 

Our group studies problems of theory of scheduling, industrial planning, timetabling and financial mathematics. We work on the Computing Centre of the Russian Academy of Sciences.



    News:

1st December, 2006
  An Article "The Pareto-Optimal Set of the NP-hard Problem of Minimization of the Maximum Lateness for a single Machine"

The classical problem of scheduling theory 1|r_j| L max is considered. New properties of optimal schedules are found.

1st October, 2006
  1C:USO Enterprise information system

In november-december new Information System for constructing companies 1C:USO will be presented. Our group take a part in this project. We have adapted algorithms for Resource Constrainted Project Scheduling Problems for real-world tasks. By results of our experiments our solution is more effective than solutions used in MS Project, Primavera.



(1999)

    Our basic objectivities and purposes are the following:

Provide theoretical science researches in theory of scheduling, industrial planning, timetabling and financial mathematics;
Provide practical researches to confirm our theoretical results and create new principles;
Create software packages for theoretical and practical requirements.

    Last updates happens on the following pages:

Members: People
Ideas: it is added new results of researches problems theory of scheduling: aim function's smoothing, research of example's complexity;
Links: new scientific links with A S A P group (Prof. E. K. Burke) and Prof. W. Szwarc.



    Rambler's Top100

    Members
    Library
    Problems
    Links
    Courses
    Contacts
    News