Makespan Minimization via Posted Prices.
Michal FeldmanAmos FiatAlan RoytmanPublished in: CoRR (2017)
Keyphrases
- makespan minimization
- processing times
- scheduling problem
- parallel machines
- metaheuristic
- special case
- job shop scheduling problem
- flowshop
- single machine
- polynomial time approximation
- total weighted tardiness
- polynomially solvable
- setup times
- release dates
- np hard
- np complete
- ant colony optimization
- minimum cost
- tabu search
- genetic algorithm
- sequence dependent setup times
- long run
- graph model
- combinatorial optimization problems
- optimization problems
- simulated annealing
- parallel computing
- lagrangian relaxation
- precedence constraints
- single machine scheduling problem
- optimal solution
- memetic algorithm
- computational complexity
- approximation algorithms
- benchmark problems
- traveling salesman problem
- particle swarm optimization
- dynamic programming