Scheduling Plans of Tasks

TL;DR

This paper introduces a polynomial-time heuristic algorithm for scheduling task plans that maximizes the number of plans executed within a fixed time window while respecting various constraints.

Contribution

The paper proposes a new heuristic algorithm for scheduling plans of tasks that handles complex constraints and has polynomial worst-case complexity.

Findings

The heuristic effectively finds feasible schedules respecting constraints.

It maximizes the number of scheduled plans within the time window.

The algorithm operates in polynomial time.

Abstract

We present a heuristic algorithm for solving the problem of scheduling plans of tasks. The plans are ordered vectors of tasks, and tasks are basic operations carried out by resources. Plans are tied by temporal, precedence and resource constraints that makes the scheduling problem hard to solve in polynomial time. The proposed heuristic, that has a polynomial worst-case time complexity, searches for a feasible schedule that maximize the number of plans scheduled, along a fixed time window, with respect to temporal, precedence and resource constraints.