Complexity and approximation for scheduling problem for a torpedo.
Gilles SimoninRodolphe GiroudeauJean-Claude KönigPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- scheduling problem
- approximation error
- tabu search
- error bounds
- approximation algorithms
- single machine
- np hard
- worst case
- neural network
- precedence constraints
- flowshop
- computational complexity
- increase in computational complexity
- special case
- optimal solution
- reinforcement learning
- space complexity
- complexity analysis
- social networks
- database
- total tardiness