Parallel Machine Scheduling with an Aid of Network Flow Model

네트워크 흐름 모형을 이용한 병행기계(併行機械) 시스템의 스케쥴링

The problem of scheduling n-jobs on m-uniform parallel machines is considered, in which each job has a release time, a deadline, and a processing requirement. The job processing requirements are allocated to the machines so that the maximum of the load differences between time periods is minimized. Based on Federgruen's maximum flow network model to find a feasible schedule, a polynomially bounded algorithm is developed. An example to show the effectiveness of our algorithm is presented.