Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times

Axel Parmentier, Vincent T'kindt

Abstract: Highlights•Machine learning heuristic for a hard single machine scheduling problem.•The hard problem is approximated by an easier one to exploit its structure.•Structured learning is the key ingredient to learn the approximation.•Experiments show that it is competitive with state-of-the-art heuristics.