Existence and finiteness of the sample-mean limit of sojourn times of jobs in a queueing system are investigated. The queueing system operates under rather general multiprocessor disciplines allowing job classes and priorities. The input stream of jobs consisting of job classes and 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 controlled by uniform mixing of the input stream.
