Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem.
Feng ShiXiankun YanFrank NeumannPublished in: CoRR (2022)
Keyphrases
- scheduling problem
- evolutionary algorithm
- chance constrained
- stochastic programming
- flowshop
- knapsack problem
- optimization problems
- single machine
- robust optimization
- multi objective
- permutation flowshop
- np hard
- evolutionary computation
- processing times
- minimizing makespan
- computationally tractable
- chance constrained programming
- setup times
- tabu search
- differential evolution
- chance constraints
- reverse logistics
- fitness function
- simulated annealing
- multi objective optimization
- linear program
- multistage
- genetic algorithm
- third party
- release dates
- parallel machines
- strongly np hard
- unrelated parallel machines
- fuzzy logic
- special case
- particle swarm optimization
- search algorithm
- optimal solution
- mathematical programming