Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties.
Jorge M. S. ValenteRui A. F. S. AlvesPublished in: Comput. Oper. Res. (2008)
Keyphrases
- single machine scheduling problem
- weighted tardiness
- branch and bound algorithm
- sequence dependent setup times
- release dates
- processing times
- single machine
- resource consumption
- combinatorial optimization
- search algorithm
- pairwise
- objective function
- precedence constraints
- hybrid algorithm
- lagrangian relaxation
- search procedure
- optimal solution
- scheduling algorithm
- branch and bound
- simulated annealing
- completion times
- lower bound
- computational complexity