Fixed Job Scheduling with Two Types of Processors
研究一个包含两种处理器和三种作业的调度问题，其中作业有固定起止时间，提出多项式算法通过构建作业调度网络并转化为单商品流问题来求解最小成本处理器组合。
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 type 1 can be done only by type-1 processors, type-2 jobs only by type-2 processors, and type-0 jobs by either type of processors. We present a polynomial algorithm for finding the minimal cost combination of the two types of processors required to complete all jobs. The steps of the algorithm consist of constructing a job schedule network, transforming it into a single-commodity flow problem and finding the maximal flow through it.