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