A note on exact algorithms for the identical parallel machine scheduling problem.
Mauro Dell'AmicoSilvano MartelloPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- exact algorithms
- parallel machine scheduling problem
- scheduling problem
- knapsack problem
- release dates
- parallel machines
- total weighted tardiness
- exact solution
- approximation algorithms
- single machine
- benchmark instances
- sequence dependent setup times
- combinatorial optimization
- max sat
- heuristic methods
- maximum lateness
- combinatorial optimization problems
- tabu search
- processing times
- combinatorial problems
- flowshop
- np hard
- single machine scheduling problem
- lower bound
- cost function
- setup times
- column generation
- traveling salesman problem