Tvarkaraščių su ribotais ištekliais sudarymo euristiniai algoritmai, jų tyrimas ir taikymai
Resource Constrained Project Scheduling Heuristic Algorithms, Investigations and Applications

Summary/Abstract: We can often meet the problem of making some scheduler of tasks or jobs with constrained resources in solving engineering problems. In this paper we discuss about algorithms of making job schedulers and their optimization with constrained resources. The optimization of job scheduler is described by some kind of neighborhood, got by „shift“ or „swap“ operations. Accepting of new scheduler, got by these operations, is performed by operations „check and move“ or „move and repair“. Search of optimal scheduler is performed using simulated annealing, tabu search, genetic algorithms. The efficiency of search algorithm was tested using benchmark sets from resource constrained project scheduling problems library (PSPLib).

• Details
• Contents