Existence and finiteness of the sample-mean limit of sojourn times of
jobs in a queueing system are investigated. The queueing system operat
es under rather general multiprocessor disciplines allowing job classe
s and priorities. The input stream of jobs consisting of job classes a
nd interarrival and processing times is stationary and ergodic and may
contain batch arrivals. Existence of the sample-mean limit is proved
by means of the superadditive ergodic theorem, and its finiteness is c
ontrolled by uniform mixing of the input stream.