A multicriterial problem in scheduling theory with inventory resources

The complexity of the single-dimensional case of a multicriterial scheduling theory problem is considered for inventory resources. The problem is solved by an algorithm of compact vector summation which provides a quaranteed error estimate. An extension to the case of several independent computers which share resources is discussed. Results of a computing experiment are reported.