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