Algorithms based on VNS for solving the Single Machine Scheduling Problem with Earliness and Tardiness Penalties.
Bruno Ferreira RosaMarcone J. F. SouzaSérgio Ricardo de SouzaPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- single machine scheduling problem
- combinatorial optimization
- optimization problems
- single machine
- processing times
- hybrid algorithm
- branch and bound algorithm
- variable neighborhood search
- metaheuristic
- computational efficiency
- worst case
- query processing
- lagrangian relaxation
- query optimization
- branch and bound
- tabu search
- knapsack problem
- solution quality
- approximate solutions
- lp relaxation
- evolutionary algorithm
- computational complexity