TWe perform a novel analysis of the fitness landscape of thejob-shop scheduling problem (JSP). In contrast to other well-known combinatorial optimization problems, we show that the landscape of the JSP is non-regular, in that the connectivity of solutions is variable.

Introduction -- Primer of convex analysis -- Variational analysis -- Linear and nonlinear optimization problems -- Probability and Statistics -- Fundamental modeling questions in stochastic programming -- Adjusting to uncertainty: modeling recourse -- Probability constraints -- Proximal point...