Two meta-heuristics to solve a coordinated air transportation and production scheduling problem with time windows for the due date.
Reza Tavakkoli-MoghaddamMostafa Hajiaghaei-KeshteliM. MousaviMehdi Ranjbar-BouraniPublished in: SMC (2016)
Keyphrases
- metaheuristic
- tabu search
- scheduling problem
- vehicle routing problem
- makespan minimization
- simulated annealing
- ant colony optimization
- optimization problems
- flowshop
- feasible solution
- search space
- single machine
- genetic algorithm
- combinatorial optimization
- np hard
- processing times
- combinatorial problems
- mixed integer program
- traveling salesman problem
- strongly np hard
- simulated annealing and tabu search
- mathematical programming
- production planning
- specific problems
- optimal solution
- benchmark instances
- world wide
- memetic algorithm
- hybrid algorithm
- particle swarm optimization
- combinatorial optimization problems
- job shop scheduling problem
- routing problem
- precedence constraints
- production scheduling
- setup times
- evolutionary algorithm
- search procedure
- hybrid algorithms
- lower bound
- computational complexity
- tardiness cost