Abstract— To compute collision-free and dynamicallyfeasibile trajectories that satisfy high-level specifications given in a planning-domain definition language, this paper prop...
When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and must either backtrack or otherwise modify the plan to m...
We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects t...
Ivan B. Vermeulen, Sander M. Bohte, D. J. A. Somef...
This paper investigates two integer linear programming models that integrate requirement scheduling into software release planning. The first model can schedule the development of ...
C. Li, J. M. van den Akker, Sjaak Brinkkemper, Gui...
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...