Bierwirth, Christian; Mattfeld, Dirk Christian; Watson, … - 2004
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.