Business & Economics
Allocation Problem
9%
Ants
11%
Assembly Line
38%
Assembly Line Balancing
100%
Assignment
9%
Assignment Problem
19%
Barcelona
7%
Beam Search
7%
Benchmark
5%
Benders Decomposition
10%
Bin Packing Problem
9%
Branch and Bound Algorithm
9%
Car
7%
Coefficients
6%
Combinatorial Optimization
8%
Costs
7%
Due Dates
8%
Dynamic Programming
12%
Exact Solution
6%
Experiment
13%
Genetic Algorithm
8%
Heuristic Algorithm
10%
Heuristic Method
12%
Heuristics
35%
Integer Programming
6%
Interval Data
14%
Line Balancing
22%
Local Search
14%
Lower Bounds
24%
Memetic Algorithm
6%
Metaheuristics
10%
Metropolitan Areas
6%
Modeling
5%
Multi-armed Bandit
6%
Network Design
10%
NP-hard
11%
Optimal Solution
5%
Optimality
6%
Optimization Problem
11%
Scheduling Problem
8%
Sequencing
9%
Set Covering Problem
16%
Single Machine
7%
Single Machine Scheduling
10%
Throughput
5%
Uncertainty
5%
Upper Bound
6%
Workers
12%
Workload
13%
Workstation
16%
Mathematics
Ant Algorithm
22%
Ant Colony
9%
Ant Colony Algorithm
7%
Assembly Line
29%
Assembly Line Balancing
93%
Assignment
6%
Assignment Problem
18%
Balancing
17%
Benchmark
7%
Benders Decomposition
6%
Bin Packing Problem
8%
Branch and Bound Algorithm
7%
Combinatorial Optimization Problem
7%
Computational Experiments
18%
Constraint Programming
5%
Costs
7%
Due Dates
6%
Dynamic Programming
9%
Earliness
6%
Exact Algorithms
14%
Exact Method
18%
Formulation
8%
Heuristic algorithm
13%
Heuristic Method
10%
Heuristics
34%
Hybrid Genetic Algorithm
7%
Hyper-heuristics
7%
Integer Programming
6%
Interval Data
7%
Job Scheduling
6%
Line
6%
Local Search
7%
Lower bound
7%
Memetic Algorithm
7%
Metaheuristics
14%
Minmax Regret
20%
Multi-armed Bandit
6%
Neighborhood Search
9%
NP-complete problem
6%
Optimal Solution
6%
Optimization
7%
Precedence Constraints
14%
Quality of Service
6%
Scheduling Problem
11%
Set Covering Problem
6%
Single Machine
8%
Single Machine Scheduling
11%
Tardiness
6%
Total Weighted Completion Time
6%
Workload
13%
Engineering & Materials Science
Ant colony optimization
7%
Bins
14%
Branch and bound method
6%
Combinatorial optimization
9%
Costs
7%
Dynamic programming
8%
Experiments
12%
Flexible manufacturing systems
5%
Genetic algorithms
7%
Heuristic algorithms
13%
Heuristic methods
10%
Integer programming
10%
Just in time production
6%
Linear programming
14%
NP-hard
13%
Operations research
6%
Restoration
10%
Robotic assembly
6%
Scheduling
19%
Servers
6%
Set theory
6%
Simulated annealing
5%
Storage management
5%
Structural properties
9%
Waste management
5%
