Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
On-line scheduling with precedence constraints
Yossi Azar
*
, Leah Epstein
*
Corresponding author for this work
School of Computer Science and AI
Tel Aviv University
Research output
:
Contribution to journal
›
Article
›
peer-review
4
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On-line scheduling with precedence constraints'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Online Scheduling
100%
Precedence Constraints
100%
Preemption
50%
Greedy Algorithm
33%
Competitive Ratio
33%
Non-preemptive
33%
Restricted Assignment
33%
Online Algorithms
16%
Machine Model
16%
Uniform Machines
16%
Related Machines
16%
Scheduling Jobs
16%
Assignment Model
16%
Online Problem
16%
Mathematics
Running Time
100%
Greedy Algorithm
100%
Competitive Ratio
100%
Upper Bound
50%
Constant Factor
50%
Computer Science
Precedence Constraint
100%
Competitive Ratio
33%
Greedy Algorithm
33%
Constant Factor
16%
on-line algorithm
16%
Job Scheduling
16%