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