Keyphrases
Processing Time
83%
Single Machine
66%
Scheduling Problem
58%
NP-hard
58%
Makespan
55%
Traveling Salesman Problem
52%
Replacement Strategy
52%
Bi-criteria
52%
Job Processing
48%
Resource Consumption
46%
Cutting Tool
41%
Machining Economics
39%
Economic Problems
39%
Non-renewable Resources
37%
Sum of Completion Times
35%
Total Resources
35%
Cost per Unit
33%
Heuristic Algorithms
33%
Feed Rate
30%
Convex Resource Consumption Function
30%
Controllable Processing Times
29%
Optimal Cutting Conditions
27%
Node Cut
26%
3D Visuals
26%
Multi-observer
26%
Coverage Scheduling
26%
Limited Repairs
26%
Repair Capacity
26%
Parameterized Complexity
26%
Congestion Externalities
26%
Two-machine Flow Shop Scheduling
26%
Economical Cutting
26%
Cutting Conditions
26%
Joint Replenishment
26%
Ordering Cost
26%
Flow Path Design
26%
Flow Path
26%
Visual Areas
26%
Resource Dependence
26%
Dependant
26%
Resource-dependent Processing Times
26%
Release Dates
26%
Number of Tardy Jobs
26%
Area Coverage
26%
Transfer Machine
26%
Optimal Resource Allocation
24%
Dynamic Programming Algorithm
24%
Polynomial-time Algorithm
24%
Optimal Flow
22%
Polynomial Time
21%
Mathematics
Polynomial Time
100%
Minimizes
72%
Single Machine
70%
Consumption Function
66%
Bicriteria
52%
Traveling Salesman Problem
52%
Open Question
44%
Heuristic Algorithm
33%
Cut Node
26%
Objective Function
26%
Cost Function
26%
Unit Time
26%
Polynomial
22%
Wide Range
22%
Fully Polynomial Approximation Scheme
19%
Reduced Problem
19%
Approximates
19%
Planning Horizon
17%
Covering Problem
17%
Heuristic Method
17%
Tradeoff
17%
Iterative Solution
16%
Total Time
16%
Positive Integer
15%
Upper Bound
15%
Observation Point
13%
Simulation Study
13%
Time Unit
13%
Decreasing Function
13%
Fixed Costs
13%
Inventory Policy
13%
Search Algorithm
13%
Performance Measure
13%
Data Structure
13%
Probability Distribution Function
13%
Minimization Problem
13%
Logistic Model
13%
Single Variable
13%
Fixed Number
13%
Scale Problem
11%
Numerical Example
6%
Solution Exists
6%
Linear Function
6%
Permutation
6%
Convex Function
6%
Matrix (Mathematics)
6%
Computer Science
Processing Time
91%
Scheduling Problem
77%
Single Machine
39%
Resource Allocation
35%
Polynomial Time
35%
Resource Consumption
28%
Flowshop Scheduling
26%
Graph Cut
26%
Positive Integer
26%
Large-Scale Problem
26%
Coverage Area
26%
Heuristic Algorithm
19%
Approximation (Algorithm)
17%
Computational Complexity
16%
Polynomial Time Algorithm
15%
Operational Analysis
13%
Just-in-Time
13%
Prior Probability
13%
Graph Search Problem
13%
Dynamic Programming Algorithm
13%
Traveling Salesman Problem
13%
Local Optimal Solution
13%
Military System
13%
Simulation Study
13%
Complexity Analysis
13%
Process Improvement
13%
Defense Industry
13%
Defense Contractor
13%
Resource Consumption Cost
13%
Assignment Problem
13%
polynomial-time algorithm
13%
Observation Point
13%
Optimization Algorithm
13%
Exact Location
13%
Policy Implication
13%
Data Structure
13%
Minimization Problem
13%
Single Variable
13%
Branch-and-Bound Algorithm
13%
Decision-Making
13%
Routing Problem
11%
Computation Time
11%
Heuristic Method
11%
Set Covering Problem
11%
Planning Horizon
11%
Solution Method
6%
Completion Time
6%
single machine scheduling problem
6%
Computational Experiment
6%
Randomly Generated Instance
6%
