Claus Hüsselmann, Horst W. Hamacher

• Max ordering (MO) optimization is introduced as tool for modelling production planning with unknown lot sizes and in scenario modelling. In MO optimization a feasible solution set \(X\) and, for each \(x\in X, Q\) individual objective functions \(f_1(x),\dots,f_Q(x)\) are given. The max ordering objective \(g(x):=max\) {\(f_1(x),\dots,f_Q(x)\)} is then minimized over all \(x\in X\). The paper discusses complexity results and describes exact and approximative algorithms for the case where \(X\) is the solution set of combinatorial optimization problems and network flow problems, respectively.