Introduction Planning and scheduling attract a high attention of computer science community because of their real-life applicability and challenging complexity. However, despite of their similar character, planning and scheduling problems are usually handled separately using different methods and technologies. Planning deals with finding plans to achieve some goal, i.e., finding a sequence of actions that will transfer the initial world into one in which the goal description is true. Moreover, the feasible sequences of actions must respect constraints describing the limitations of the world. Opposite to planning, scheduling deals with the exact allocation of resources to activities over time respecting precedence, duration, capacity, and incompatibility constraints. Such strict decomposition of the task into planning and scheduling parts is not desirable in some applications where activities must be introduced during scheduling. We describe se
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.