Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties.
Mariona VilàJordi PereiraPublished in: Comput. Oper. Res. (2013)
Keyphrases
- single machine scheduling problem
- search procedures
- combinatorial optimization
- pairwise
- data sets
- optimal solution
- search strategies
- deteriorating jobs
- decision trees
- lagrangian relaxation
- tabu search
- dynamic programming
- computational complexity
- objective function
- constraint satisfaction
- simulated annealing
- heuristic methods
- precedence constraints
- search algorithm
- exact and approximate