Year-end Sale % OFF 
Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
