We consider a scheduling problem that involves two types of processors, but three types of jobs. Each job has a fixed start time and a fixed completion time, and falls into one of three types. Jobs of ...

Operations Research, Vol. 20, No. 3 (May - Jun., 1972), pp. 689-697 (9 pages) This paper presents an algorithm that will minimize the total processing time for a particular case of the n-job, ...