Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the search space. For example, in flow shop scheduling problems with order-based objectives (e.g. tardiness costs and earliness costs), search space reductions have been implemented with precedence constraints. Experiments sho...

In many scheduling applications it is required that the processing of some job be postponed until some other job, which can be chosen from a pregiven set of alternatives, has been completed. The traditional concept of precedence constraints fails to model such restrictions. Therefore, the concept has been generalized to so-called and/or precedence constraints which can cope with this kind of re...

The following two-machine flow-shop scheduling problem is solved. Given jobs are classified into groups, and each machine needs some setup before the first job in a group is started processing. If a job in a group is started its process, all jobs in the group must be finished before a job in another group is processed. Each job may have a specified lag time between machines. Moreover, a series-...

The automatic discovery of a process model out of a historical log traces can be of great value for both analysis and design tasks, and is a major goal of Process Mining approaches. A key step in discovering such a model consists in detecting a graph of causal/precedence dependencies over process activities – which can be possibly used to eventually derive more expressive control-flow (e.g., Pe...

Recently, Helmert and Geffner proposed the context-enhanced additive heuristic, where fact costs are evaluated relative to context states that arise from achieving first a pivot condition of each operator. As Helmert and Geffner pointed out, the method can be generalized to consider contexts arising from arbitrary precedence constraints over operator conditions instead. Herein, we provide such ...