Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

The problem of order allocation belongs to a category of combinatorial optimization problems where orders are allocated to machines for production. Each order is assigned to a single machine, while ...