On Formulating the Ground Scheduling Problem as a Multi-objective Bilevel Problem.
Margarita AntoniouGasper PetelinGregor PapaPublished in: BIOMA (2020)
Keyphrases
- multi objective
- scheduling problem
- bi objective
- evolutionary algorithm
- multi objective optimization
- optimization algorithm
- single machine
- np hard
- flowshop
- setup times
- tabu search
- linear programming
- particle swarm optimization
- multiobjective optimization
- genetic algorithm
- objective function
- evolutionary optimization
- precedence constraints
- conflicting objectives
- processing times
- minimizing makespan
- pareto optimal
- nsga ii
- parallel machines
- total tardiness
- multiple objectives
- definite clause
- permutation flowshop
- sequence dependent setup times
- job shop scheduling problem
- differential evolution
- lower level
- multi objective evolutionary algorithms
- strongly np hard
- bilevel programming
- multiobjective evolutionary algorithm
- implicit enumeration
- lower bound