A locally optimal insertion heuristic for a one-machine scheduling problem

What is it about?

A single machine problem with given release dates and the minimization of the number of late jobs is considered. An constructive insertion heuristic is presented which yields a locally optimal solution in a left shift neighborhood.

Featured Image