In this paper, we present the problem of assigning consistent time windows for the collection of multiple fresh products from local farmers and delivering them to distribution centers for consolidation and further distribution in a short agri-food supply chain with stochastic demand. We...

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.

We consider job shop scheduling problems with release and due-dates, as well as various tardiness objectives. To date, no efficient general-purpose heuristics have been developed for these problems. genetic algorithms can be applied almost directly, but come along with apparent weaknesses.