search query: @author Federgruen, A. / total: 37
reference: 29 / 37
| Author: | Federgruen, A. Groenevelt, H. |
| Title: | Preemptive scheduling of uniform machines by ordinary network flow techniques. |
| Journal: | Management Science
1986 : MAR, VOL. 32:3, p. 341-349 |
| Index terms: | PRODUCTION SCHEDULING NETWORK ANALYSIS |
| Language: | eng |
| Abstract: | The problem of scheduling n jobs, each with a specific processing requirement, release time and due date on m uniform parallel machines is considered. 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 codes. Algorithms for the maximum lateness criterion are described. A bound is developed which compares even more favorably to the best previous bound. It is also shown how other criteria can be optimized by similar path augmenting techniques. |
SCIMA