On exact algorithms for single-machine scheduling problems with a variable maintenance.
Qi WangAihua LiuJunfang XiaoPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- exact algorithms
- single machine scheduling problem
- combinatorial optimization
- approximation algorithms
- knapsack problem
- precedence constraints
- branch and bound algorithm
- exact solution
- combinatorial optimization problems
- combinatorial problems
- heuristic methods
- metaheuristic
- branch and bound
- resource consumption
- processing times
- lower bound
- search procedure
- traveling salesman problem
- simulated annealing
- neural network
- single machine
- constraint satisfaction
- computational efficiency
- orders of magnitude
- upper bound
- evolutionary algorithm