Exact algorithms for single-machine scheduling problems with a variable maintenance.
Kuo-Ching YingChung-Cheng Jason LuJhao-Cheng ChenPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- exact algorithms
- single machine scheduling problem
- combinatorial optimization
- branch and bound algorithm
- knapsack problem
- approximation algorithms
- max sat
- precedence constraints
- exact solution
- combinatorial optimization problems
- combinatorial problems
- branch and bound
- column generation
- optimization problems
- processing times
- heuristic methods
- metaheuristic
- traveling salesman problem
- single machine
- lower bound
- simulated annealing
- special case
- np hard
- lagrangian relaxation
- worst case
- neural network
- evolutionary algorithm
- resource consumption
- genetic algorithm