Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Optimal non-preemptive semi-online scheduling on two related machines
Leah Epstein
, Lene M. Favrholdt
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Optimal non-preemptive semi-online scheduling on two related machines'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Competitive Ratio
100%
Related Machines
100%
Non-preemptive
100%
Semi-persistent Scheduling
100%
Speed Ratio
28%
Tight
14%
Greedy Algorithm
14%
Uniform Machines
14%
Scheduling Problem
14%
Makespan
14%
Two-machine
14%
Nonincreasing
14%
Competitive Design
14%
Computer Science
Competitive Ratio
100%
Scheduling Problem
14%
Greedy Algorithm
14%
Mathematics
Competitive Ratio
100%
Greedy Algorithm
14%