Keyphrases
Single Machine Scheduling
100%
Total Completion Time
100%
Approximation Algorithms
100%
Release Dates
100%
Fixed Jobs
100%
Pseudo-polynomial Time
50%
Precedence Constraints
50%
Preemption
33%
Polynomial Time
33%
P-NP
33%
Strong NP-hardness
33%
Single Machine Scheduling Problem
16%
Job Scheduling Problem
16%
Linear Time
16%
2-approximation
16%
Bin Packing Problem
16%
Fixed Job Scheduling
16%
Free Time
16%
Job Precedence Constraint
16%
Mathematics
Single Machine
100%
Minimizes
100%
Approximability
100%
Polynomial Time
66%
time interval τ
33%
Polynomial
33%
Packing Problem
33%
Linear Time
33%
Computer Science
Completion Time
100%
Approximation Algorithms
100%
Single Machine Scheduling
100%
Precedence Constraint
66%
Polynomial Time
33%
Scheduling Problem
16%
Job Scheduling
16%
Bin Packing Problem
16%
single machine scheduling problem
16%