Computer Science
Planning Horizon
100%
Dynamic Programming Algorithm
88%
Processing Time
72%
Parallel Machine Scheduling
66%
Polynomial Algorithm
44%
Machine Scheduling Problem
38%
Storage Capacity
33%
Time Complexity
33%
Parallel Machine
29%
Optimal Algorithm
27%
Transportation Cost
27%
polynomial-time algorithm
22%
Computational Complexity
22%
Phase Algorithm
22%
Transport Cost
22%
inventory cost
22%
Searching Algorithm
22%
Performance Ratio
22%
Capacity Constraint
22%
Dimensional Vector
22%
Arbitrary Number
22%
Dynamic Program
22%
Structural Property
22%
Dynamic Programming
22%
Exist Algorithm
22%
Efficient Algorithm
22%
Competitive Ratio
20%
Scheduling Problem
18%
Computational Experiment
16%
Uncapacitated Problem
16%
Service Provision
11%
Scheduling Algorithm
11%
Completion Time
11%
Solution Procedure
11%
Vendor Managed Inventory
11%
Polynomial Time
11%
Capacity Limit
11%
Greedy Algorithm
11%
multi-processor
5%
Differentiated Service
5%
Performance Bound
5%
Approximation Algorithms
5%
Heuristic Algorithm
5%
Service Request
5%
Engineering
Planning Horizon
66%
Two Dimensional
44%
Dimensional Vector
44%
Cost Function
44%
Steel Product
33%
Multistage
22%
Performance Ratio
22%
Arbitrary Number
22%
Processing Time
22%
Main Source
22%
Computational Complexity
22%
Max
22%
Solution Procedure
18%
Dynamic Programming
18%
Production Time
11%
Production Stage
11%
Optimality
11%
Production Quantity
11%
Simplest Case
11%
Approach Path
11%
Production Data
11%
Subcontractor
11%
Effective Period
11%
Special Conditions
11%
Data Show
11%
Warehouses
11%
Polynomial Time
7%
Limitations
7%
Flow Problem
5%
Supply System
5%
Mathematics
Planning Horizon
62%
Cost Function
44%
Polynomial
44%
Worst Case
44%
Competitive Ratio
27%
Structural Property
22%
Dimensional Vector
22%
Linear Time
22%
Minimizes
22%
Residuals
22%
Time Window
22%
Matrix (Mathematics)
22%
Transportation Cost
22%
Running Time
13%
Edge
11%
Greedy Algorithm
11%
Case Analysis
11%
Line Parallel
11%
Polynomial Time
7%
