Approximation and Exact Algorithms for Multiprocessor Scheduling Problem with Release and Delivery Times.
Natalia GrigorevaPublished in: WCO@FedCSIS (2020)
Keyphrases
- exact algorithms
- scheduling problem
- approximation algorithms
- np hard
- knapsack problem
- single machine
- tabu search
- vehicle routing problem with time windows
- heuristic methods
- flowshop
- worst case
- combinatorial optimization
- special case
- np complete
- minimizing makespan
- max sat
- optimal solution
- exact solution
- computational problems
- combinatorial optimization problems
- lower bound
- benders decomposition
- combinatorial problems
- linear programming
- branch and bound algorithm
- linear program
- orders of magnitude
- network design problem
- traveling salesman problem
- vehicle routing problem
- neural network
- constraint satisfaction problems
- simulated annealing
- computational complexity
- search algorithm
- objective function