Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
Optimal preemptive scheduling for general target functions
Leah Epstein, Tamir Tassa
Research output
:
Contribution to journal
›
Article
›
peer-review
12
Scopus citations
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
Target Function
100%
Preemptive Scheduling
100%
Preemption
50%
Makespan
33%
Uniform Machines
33%
Optimal Schedule
16%
Polynomial-time Algorithm
16%
Monotone
16%
One Target
16%
Parallelization
16%
Scheduling Problem
16%
Makespan Minimization
16%
Mathematical Programming Problem
16%
Optimal Scheduling
16%
Mathematical Programming
16%
Associated Weights
16%
Uniform Processors
16%
Computer Science
Target Function
100%
Preemptive Scheduling
100%
Mathematical Programming
33%
Scheduling Problem
16%
Parallelization
16%
Polynomial Algorithm
16%
Mathematics
Mathematical Programming
100%
Programming Problem
50%
Polynomial
50%
Parallelization
50%