Business processes used in networked business are often large and complex, which makes them difficult to manage and change. In this paper we address this lack of flexibility by pr...
Tim van Eijndhoven, Maria-Eugenia Iacob, Mar&iacut...
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
This paper presents a methodology for automatically generating online scheduling strategies for a complex objective defined by a machine provider. To this end, we assume independe...
Carsten Franke, Frank Hoffmann, Joachim Lepping, U...
This paper revolves around the so-called plan revision rules of the agent programming language 3APL. These rules can be viewed as a generalization of procedures. This generalizatio...