A hybrid heuristic approach for single machine scheduling with release times
Résumé
In this work we consider the well-known one-machine total completion time sequencing problem subject to release times. We present a very large scale neighborhood search heuristic based on mathematical programming. This heuristic makes use of the positional completion time formulation of the problem in which valid inequalities are added. The proposed procedure compares favorably with the state of the art heuristics