Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Approve / Request updates on publications
English
עברית
العربية
Search content at Open University of Israel
Home
Researchers
Research units
Research outputs
Prizes
Activities
Optimal preemptive scheduling for general target functions
Leah Epstein
,
Tamir Tassa
Computer Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Chapter
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Optimal preemptive scheduling for general target functions'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Preemptive Scheduling
100%
Target Function
100%
Makespan
33%
Preemption
33%
Monotone
16%
Polynomial-time Algorithm
16%
Mathematical Programming
16%
Scheduling Problem
16%
Uniform Machines
16%
Associated Weights
16%
Optimal Schedule
16%
Parallelization
16%
Mathematical Programming Problem
16%
One Target
16%
Optimal Scheduling
16%
Computer Science
Target Function
100%
Preemptive Scheduling
100%
Mathematical Programming
33%
Polynomial Algorithm
16%
Scheduling Problem
16%
Parallelization
16%
Mathematics
Mathematical Programming
100%
Polynomial
50%
Parallelization
50%
Programming Problem
50%