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.

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.

The ability to accurately estimate the extent to which the failure of a bank disrupts the financial system is very valuable for regulators of the financial system. One important part of the financial system is the interbank payment system. This paper develops a robust measure, SinkRank, that...

Recently, Branzei, Dimitrov, and Tijs (2003) introduced cooperative interval-valued games. Among other insights, the notion of an interval core has been coined and proposed as a solution concept for interval-valued games. In this paper we will present a general mathematical programming algorithm...

In der empirischen Wirtschaftsforschung steigt die Anzahl der Publikationen, die mit Methoden des maschinellen Lernens arbeiten. Dennoch scheint eine gewisse Skepsis zu bestehen. Ein Kritikpunkt ist, dass sich maschinelles Lernen zwar für Vorhersagen eignet, aber keine kausalen Zusammenhänge...