Scheduling Plans of Tasks
This work tackles a general scheduling problem for resource-constrained operations, which is relevant for operations management and logistics.
This paper addresses the problem of scheduling plans of tasks, which are ordered vectors of operations constrained by temporal, precedence, and resource limitations. The authors propose a heuristic algorithm that aims to maximize the number of plans scheduled within a fixed time window, while respecting all constraints.
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.