Federgruen, A.; Groenevelt, H. - In: Management Science 32 (1986) 3, pp. 341-349
We consider the problem of scheduling n jobs, each with a specific processing requirement, release time and due date on m uniform parallel machines. It is shown that a feasible schedule can be obtained by determining the maximum flow in a network, thus permitting the use of standard network flow...