Constructive heuristic algorithms for the open shop problem

Featured Image

Why is it important?

This paper presents fast constructive insertion-based heuristics combined with beam search for the open shop scheduling problem with minimizing the makespan They yield results that are close to the lower bounds on the optimal function values.