Automatic solution to a scheduling problem
First Claim
1. A method comprising:
- obtaining a scheduling problem comprising;
a set of agents and a set of tasks to be performed by the set of agents, wherein solving the scheduling problem using an automated solver is not feasible using available predetermined resources, and wherein the scheduling problem is defined in a planning domain description language;
automatically generating a plurality of alternative scheduling problems, wherein each alternate scheduling problem is created by providing additional restrictions to the scheduling problem, wherein a solution to each such alternative scheduling problem defines a solution to the scheduling problem, and wherein the additional restrictions comprise requiring a subset of the set of tasks to be performed by a same agent within the set of agents and restricting a subset of the set of agents that are capable of performing a task in the set of tasks to a smaller subset;
determining a solution to the scheduling problem by applying the automated solver to solve, while using the available predetermined resources, an alternative problem of the plurality of alternative scheduling problems to determine a solution to the alternative problem and by mapping the solution to the alternative problem to the scheduling problem, wherein the available predetermined resources comprise predetermined computation power and predetermined computation time, and the automated solver is a mixed-integer linear programming (MILP) solver; and
sending alerts to the set of agents based on the solution to the scheduling problem.
4 Assignments
0 Petitions
Accused Products
Abstract
A method comprising obtaining a scheduling problem comprising: a set of agents and a set of tasks to be performed by the set of agents, wherein solving the scheduling problem using an automated solver is not feasible using available predetermined resources. The method comprises automatically generating a plurality of alternative scheduling problems, wherein a solution to each such alternative scheduling problem defines a solution to the scheduling problem and determining a solution to the scheduling problem by applying the automated solver to solve, while using the available predetermined resources, an alternative problem of the plurality of alternative scheduling problems to determine a solution to the alternative problem and by mapping the solution to the alternative problem to the scheduling problem, whereby determining the solution.
-
Citations
13 Claims
-
1. A method comprising:
-
obtaining a scheduling problem comprising;
a set of agents and a set of tasks to be performed by the set of agents, wherein solving the scheduling problem using an automated solver is not feasible using available predetermined resources, and wherein the scheduling problem is defined in a planning domain description language;automatically generating a plurality of alternative scheduling problems, wherein each alternate scheduling problem is created by providing additional restrictions to the scheduling problem, wherein a solution to each such alternative scheduling problem defines a solution to the scheduling problem, and wherein the additional restrictions comprise requiring a subset of the set of tasks to be performed by a same agent within the set of agents and restricting a subset of the set of agents that are capable of performing a task in the set of tasks to a smaller subset; determining a solution to the scheduling problem by applying the automated solver to solve, while using the available predetermined resources, an alternative problem of the plurality of alternative scheduling problems to determine a solution to the alternative problem and by mapping the solution to the alternative problem to the scheduling problem, wherein the available predetermined resources comprise predetermined computation power and predetermined computation time, and the automated solver is a mixed-integer linear programming (MILP) solver; and sending alerts to the set of agents based on the solution to the scheduling problem. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A computerized apparatus having a processor, the processor being adapted to perform the steps of:
-
obtaining a scheduling problem comprising;
a set of agents and a set of tasks to be performed by the set of agents, wherein solving the scheduling problem using an automated solver is not feasible using available predetermined resources, and wherein the scheduling problem is defined in a planning domain description language;automatically generating a plurality of alternative scheduling problems, wherein each alternate scheduling problem is created by providing additional restrictions to the scheduling problem, wherein a solution to each such alternative scheduling problem defines a solution to the scheduling problem, and wherein the additional restrictions comprise requiring a subset of the set of tasks to be performed by a same agent within the set of agents and restricting a subset of the set of agents that are capable of performing a task in the set of tasks to a smaller subset; determining a solution to the scheduling problem by applying the automated solver to solve, while using the available predetermined resources, an alternative problem of the plurality of alternative scheduling problems to determine a solution to the alternative problem and by mapping the solution to the alternative problem to the scheduling problem, wherein the available predetermined resources comprise predetermined computation power and predetermined computation time, and the automated solver is a mixed-integer linear programming (MILP) solver; and sending alerts to the set of agents based on the solution to the scheduling problem. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. A computer program product comprising a non-transitory computer readable storage medium retaining program instructions, which program instructions when read by a processor, cause the processor to perform a method comprising:
-
obtaining a scheduling problem comprising;
a set of agents and a set of tasks to be performed by the set of agents, wherein solving the scheduling problem using an automated solver is not feasible using available predetermined resources, and wherein the scheduling problem is defined in a planning domain description language;automatically generating a plurality of alternative scheduling problems, wherein each alternate scheduling problem is created by providing additional restrictions to the scheduling problem, wherein a solution to each such alternative scheduling problem defines a solution to the scheduling problem, and wherein the additional restrictions comprise requiring a subset of the set of tasks to be performed by a same agent within the set of agents and restricting a subset of the set of agents that are capable of performing a task in the set of tasks to a smaller subset; determining a solution to the scheduling problem by applying the automated solver to solve, while using the available predetermined resources, an alternative problem of the plurality of alternative scheduling problems to determine a solution to the alternative problem and by mapping the solution to the alternative problem to the scheduling problem, wherein the available predetermined resources comprise predetermined computation power and predetermined computation time, and the automated solver is a mixed-integer linear programming (MILP) solver; and sending alerts to the set of agents based on the solution to the scheduling problem.
-
Specification