| Article ID: | iaor19911578 |
| Country: | Switzerland |
| Volume: | 26 |
| Start Page Number: | 243 |
| End Page Number: | 256 |
| Publication Date: | Dec 1990 |
| Journal: | Annals of Operations Research |
| Authors: | De Werra D. |
Graph-theoretical models are described for solving preemptive and nonpreemptive scheduling problems with renewable resources. Conditions are obtained for nonpreemptive schedules to exist. These results may be applied for reducing the preemptions in the schedules obtained by the two-phase method developed for preemptive scheduling on unrelated processors.