Abstract
The dissertaion deals with solving scheduling problems by means of constraint satisfaction technology, in particular, with design of filtering algorithms for global constraints modelling resources. The main results are new data structures Theta-tree and Theta-Lambda-tree, their exploitation in filtering algorithms for unary resources, and extension of these algorithms to optional activities and to batch processing with setup times.