IP Library Patent Application 11750675
Patent Application
App. No. 11/750,675

Dynamic Workflow Scheduling

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
11/750,675
Abstract

Methods and apparatus are disclosed for workflow scheduling. A workflow scheduling system, such as a computer system, is used to coordinate and schedule tasks in complex scheduling environments. The system accepts incoming orders and dynamically schedules them according to the constraints of the resources required for the order and any constraints of the orders themselves.

Claims (50)

1 . A method of scheduling using a computer system comprising:

receiving one or more orders;

determining scheduling constraints for fulfilling the orders;

determining availability of one or more resources for fulfilling the orders;

scheduling the one or more orders based on the scheduling constraints and the availability of the one or more resources.

2 . The method of claim 1 wherein receiving one or more orders comprises retrieving the orders from a memory.

3 . The method of claim 1 wherein determining scheduling constraints comprises:

retrieving information from a knowledge base.

4 . The method of claim 3 wherein the knowledge base comprises at least one of a temporal constraint list, a resource constraint list, a medical constraint list, a timing list, and a workflow template.

5 . The method of claim 1 wherein determining availability of one or more resources comprises:

determining a current schedule of the one or more resources.

6 . The method of claim 1 wherein scheduling the one or more orders order based on the scheduling constraints and the availability of the one or more resources comprises:

determining a schedule for the orders and the resources using a backtracking search algorithm.

7 . The method of claim 1 further comprising:

reserving the resources based on the scheduled orders; and

generating schedules for each of the orders and the resources.

8 . The method of claim 1 wherein scheduling the one or more orders based on the scheduling constraints and the availability of the one or more resources comprises:

determining multiple possible schedules; and

ranking one or more parameters of the schedules.

9 . A scheduling system comprising:

an order input interface;

a knowledge base;

a resource manager; and

a scheduler configured to receive one or more orders from the order input interface, receive information from the knowledge base and the resource manager, and generate a schedule for the one or more orders based on the information received from the knowledge base and the resource manager.

10 . The scheduling system of claim 9 wherein the order input interface comprises a memory configured to store orders.

11 . The scheduling system of claim 9 wherein the knowledge base comprises at least one of a temporal constraint list, a resource constraint list, a medical constraint list, a timing list, and a workflow template.

12 . The scheduling system of claim 9 wherein the resource manager comprises a schedule of one or more resources.

13 . The scheduling system of claim 9 wherein the scheduler is further configured to:

reserve resources through the resource manager based on the scheduled orders; and

generate schedules for each of the orders and the resources.

14 . A machine readable medium having program instructions stored thereon, the instructions capable of execution by a processor and defining the steps of:

receiving one or more orders;

determining scheduling constraints for fulfilling the orders;

determining availability of one or more resources for fulfilling the orders;

scheduling the one or more orders based on the scheduling constraints and the availability of the one or more resources.

15 . The machine readable medium of claim 14 , wherein the instructions further define the step of:

retrieving the orders from a memory.

16 . The machine readable medium of claim 14 , wherein the instructions further define the step of:

retrieving information from a knowledge base.

17 . The machine readable medium of claim 14 , wherein the knowledge base comprises at least one of a temporal constraint list, a resource constraint list, a medical constraint list, a timing list, and a workflow template.

18 . The machine readable medium of claim 14 , wherein the instructions further define the step of:

determining a current schedule of the one or more resources.

19 . The machine readable medium of claim 14 , wherein the instructions further define the step of:

determining a schedule for the orders and the resources using a backtracking search algorithm.

20 . The machine readable medium of claim 14 , wherein the instructions further define the step of:

reserving the resources based on the scheduled orders; and

generating schedules for each of the orders and the resources.

21 . The machine readable medium of claim 14 , wherein the instructions further define the step of:

determining multiple possible schedules; and

ranking one or more parameters of the schedules.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 15, 2008
From: SIEMENS CORPORATE RESEARCH, INC.
To: SIEMENS MEDICAL SOLUTIONS USA, INC.
Reel/Frame 021528/0107 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 28, 2007
From: SONG, XIPING
To: SIEMENS CORPORATE RESEARCH, INC.
Reel/Frame 019494/0067 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 28, 2007
From: HAN, MINMIN
To: SIEMENS CORPORATE RESEARCH, INC.
Reel/Frame 019494/0076 →