System and method for on-line planning utilizing multiple planning queues
US8463416B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 16, 2009 |
| Grant date | Jun 11, 2013 |
| Priority date | — |
| Expiry date | Feb 9, 2032 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG03G2215/00126
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Features described herein relate to concurrently processing multiple batches of job requests for one or more machines and/or components thereof, using a plurality of job planning queues. Each batch of job requests is allocated to a planning queue, and each planning queue comprises an unplanned subqueue that stores unplanned jobs, an unsent subqueue that stores planned jobs waiting to be executed, and a sent subqueue that stores planned jobs that have been output to the machine(s) for execution. A job planner and related components determine which unsent subqueue has the fewest planned jobs at a given point in time, and selects an unplanned job from the unplanned subqueue in the same planning queue as the identified unsent subqueue. The planner then generates a plan for the selected job and inserts the planned job into the unsent subqueue for eventual output to the machine(s) for execution. In this manner, the unsent subqueues for each planning queue are maintained with substantially equal numbers of planned jobs ready for execution, which improves throughput by ensuring that all machines and/or associated components are kept busy.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.