Search on the enumeration tree in the multiprocessor job-shop problem

What is it about?

This paper presents an approach based on a two-stage filtration of the set of feasible solutions for the multiprocessor job-shop scheduling problem. On the first stage, we use extensive dominance relations, whereas on the second stage we use lower bounds. We show that several lower bounds can efficiently be obtained and implemented.

Featured Image