Solving large instances applying meta-heuristics for classical parallel machine scheduling problems under tardiness and earliness penalties.
Rainer AmorimMarcos ThomazRosiane de Freitas RodriguesPublished in: CLEI (2017)
Keyphrases
- metaheuristic
- single machine scheduling problem
- combinatorial optimization
- sequence dependent setup times
- parallel machine scheduling problem
- mip solver
- single machine
- scheduling problem
- total weighted tardiness
- benchmark instances
- release dates
- single machine scheduling
- tabu search
- simulated annealing
- suboptimal solutions
- processing times
- combinatorial optimization problems
- job shop scheduling problem
- optimization problems
- parallel machines
- ant colony optimization
- optimal solution
- genetic algorithm
- branch and bound algorithm
- combinatorial problems
- traveling salesman problem
- search space
- flowshop
- setup times
- vehicle routing problem
- variable neighborhood search
- particle swarm optimization
- branch and bound
- search procedure
- hybrid algorithm
- np hard
- precedence constraints
- valid inequalities
- np complete problems
- lot sizing
- benchmark problems