The LOMNICKI algorithm for n/m/P/Fmax flow-shop problems is unsuitable for large values of n and m because of the time and size of storage required to attain an optimal solution. The form of presentation of the problem to the algorithm can influence its performance. The algorithm performance can be improved applying the algorithm to the problem and to its inverse at the same time, both applications sharing the best value and the best bound found. Further exploitation of properties of the inverse problem are useful also to solve hard instances of the problem.
