PLEIADA:Parallel Time Scheduling of Human Resources in the Internet

The project deals with problem of scheduling human resources which is a combinatorial NP-hard problem. The objectives of the project are the design, analysis, implementation and experimental testing of efficient algorithms for problems, which appear in wireless communication environments.

The project deals with problem of scheduling human resources which is a combinatorial NP-hard problem. During the project we will study and implement algorithms from the Operational Research and Constraint programming. Furthermore, we will investigate for possible solutions of scheduling problems in locally connected computers and Local Area Networks whose computers are located in different regions and their interconnection is slow and its behavior is not predictable.