Graph-based schedule builder for tightly constrained scheduling problems
US6490566B1 · kind B1 · utility
63Cited by
3References
27Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | May 5, 1999 |
| Grant date | Dec 3, 2002 |
| Priority date | — |
| Expiry date | May 5, 2019 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q10/06316
- WIPO fieldIT methods for management
- WIPO sectorElectrical engineering
Abstract
A computer-implemented system (10) for task scheduling. The system (10) models an enterprise in terms of products, tasks and resources used to make them, and constraints imposed in scheduling tasks. A scheduling engine, comprised of a genetic algorithm (13) and a schedule builder (14), operates on the model to produce candidate schedules. The schedule builder (14) uses graph theory techniques to solve tightly constrained scheduling problems. Each candidate schedule is evaluated and used to generate an improved schedule in accordance with genetic processing, until a best schedule is produced.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.