The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect.
Radoslaw RudekPublished in: Appl. Math. Comput. (2012)
Keyphrases
- maximum lateness
- np hardness
- scheduling problem
- np hard
- single machine
- flowshop
- precedence constraints
- sequence dependent setup times
- approximation algorithms
- parallel machines
- release dates
- branch and bound algorithm
- setup times
- processing times
- special case
- optimal solution
- lower bound
- tabu search
- computational complexity
- batch processing machines
- linear programming
- worst case
- decision problems
- single machine scheduling problem
- linear program
- objective function
- integer programming
- knapsack problem
- bayesian networks
- genetic algorithm