Flow-shop scheduling with max-plus algebra

Is there a way to determine an order in which \(n\) jobs should be processed at \(m\) machines in the shortest possible time, without exhaustive checking? This is the flow-shop scheduling problem. This article surveys solutions that use matrices over the max-plus algebra.