Keyphrases
Agent Scheduling
5%
Approximation Algorithms
8%
Batch Processing Machine
7%
Batch Scheduling
12%
Common Due Date
5%
Competitive Ratio
12%
Completion Time Variance
6%
Computational Complexity
6%
Demand Uncertainty
7%
Deteriorating Jobs
18%
Due Date
15%
Due Date Assignment
7%
Fully Polynomial Time Approximation Scheme
11%
Job Processing
11%
Makespan
22%
Makespan Minimization
10%
Maximum Lateness
9%
NP-hard
11%
Number of Tardy Jobs
6%
Online Algorithms
14%
Online Scheduling
7%
Parallel Batch Machines
15%
Parallel-batch Scheduling
12%
Pareto-scheduling
8%
Polynomial Time
10%
Polynomial-time Algorithm
11%
Polynomial-time Approximation Scheme
6%
Polynomially Solvable
5%
Precedence Constraints
6%
Preemption
8%
Preemptive Scheduling
5%
Processing Time
50%
Release Dates
22%
Scheduling Jobs
5%
Scheduling Problem
38%
Service Provider
5%
Setup Time
13%
Single Machine
46%
Single Machine Scheduling
15%
Single Machine Scheduling Problem
6%
Starting Time
5%
Strong NP-hardness
15%
Time Algorithm
8%
Total Completion Time
18%
Total Late Work
9%
Total Weighted Completion Time
12%
Two-agent
6%
Two-agent Scheduling
6%
Two-machine Flow Shop
6%
Weighted number of Tardy Jobs
10%
Mathematics
Competitive Ratio
13%
Dominating Set
5%
Fully Polynomial-Time Approximation Scheme
12%
Heuristic Algorithm
8%
Increasing Function
7%
Independent Sequence
5%
Integer
9%
Linear Function
7%
Minimizes
100%
Objective Function
13%
Polynomial
9%
Polynomial Time
45%
Single Machine
71%
Upper Bound
6%
Variance
6%
Worst Case
7%
