Data processing: generic control systems or specific application – Specific application – apparatus or process – Product assembly or manufacturing
Reexamination Certificate
1999-08-10
2003-09-23
Gandhi, Jayprakash N. (Department: 2125)
Data processing: generic control systems or specific application
Specific application, apparatus or process
Product assembly or manufacturing
C700S099000, C700S102000, C709S241000, C705S002000
Reexamination Certificate
active
06625508
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention The present invention relates to a policy based scheduler to schedule a machine based on the policies. In particular, the invention relates to a scheduler that automatically adapts to a dynamically varying environment by adding or deleting policies based on information monitored in the machine.
2. Description of Related Art
Known printing machines schedule print jobs through the machine based, at least in part, on the capabilities of the machines. A sheet to be processed through the machine is scheduled through each stage using a scheduler module that is controlled by scheduling software. Some approaches use scheduling policies (e.g., “use tray
1
if tray
2
is low on paper”) that specify criteria that must be satisfied to process the print job. In known machines, such policies are written into the logic of the scheduling software during a software development phase of the development of the printing machine. The policies are coded into the logic of the scheduling software, and the scheduling software is stored in a memory such as a ROM before the printing machine is shipped.
Scheduling rules and policies are typically dependent on the machine hardware being developed. For example, a developer of scheduling software would know, during the development time, that the duplex paper path of a particular product (e.g., for printing two sided copies) can hold a maximum of eight 8½″×11″ sheets. This means that a sheet that enters the duplex paper path will re-emerge eight pitches later since the duplex paper path is a non-stop loop. A pitch is the amount of time it takes to make one image. If the hardware is ever changed so that the length of the duplex loop changes, the software will also need to, be changed.
Other strategies for sheet scheduling are also product-specific and hard coded. For example, casual use products may strive for a low first-copy-out time, whereas production products may want to minimize the total run time even if it delays the first print out time. Once these types of policies are coded into the print scheduler, they necessitate changing the software if the policy for the product changes.
Because known systems pre-code the scheduling policies into the logic of the scheduling software, the scheduling software is static, difficult to update and not reusable on other printing machines. For example, a printing machine may be of a modular design and use a feeder module, a marker module and a stacker module, but after product release, the marker module may be redesigned to add new capabilities. Even though the modules themselves may be designed to be interchangeable, the scheduling software would have to be rewritten.
SUMMARY OF THE INVENTION
It is an object of the present invention to provide a flexible scheduler for a machine that is adaptable to dynamically varying conditions. It is a further object of the present invention to provide a process to add/delete scheduling policies to/from a list of scheduling policies based on a dynamically varying model of the machine.
These and other objects are achieved in a scheduler for a machine that includes a monitor and a selector. The monitor is used to detect an operation of the machine, the operation of the machine being at least one of a machine state, a machine performance and an environment. The selector is used to either add a selection policy from a library to a list of selection policies or to delete a selection policy from the list of selection policies in response to the detected operation. The selector includes logic to select the monitor from the library based on a model of the machine. The selector may include further logic to select monitor policies from the library, the monitor detecting the operation of the machine based on the selected monitor policies. The model of the machine includes dynamically varying information responsive to the operation detected by the monitor.
REFERENCES:
patent: 5129639 (1992-07-01), DeHority
patent: 5604600 (1997-02-01), Webster
patent: 5696893 (1997-12-01), Fromherz et al.
patent: 5701557 (1997-12-01), Webster et al.
patent: 5710635 (1998-01-01), Webster et al.
patent: 6530024 (2003-03-01), Proctor
Steven Minton et al., “Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems”, Artificial Intelligence 58 (1992), pp. 161-205.
Rina Dechter, “Enhancement Schemes For Constraint Processing: Backjumping, Learning, And Cutset Decomposition”, Artificial Intelligence 41 (1989/90), pp. 273-312.
Alan K. Mackworth, “Consistency In Networks Of Relations”, Artificial Intelligence 8 (1977), pp. 99-118.
Ian P. Gent et al., “An Empirical Study Of Dynamic Variable Ordering Heuristics For The Constraint Satisfaction Problem”, Principals and Practice Of Constraint Programming, LNAI Series #1118, (1996), pp. 179-193.
Gamma, E., et al.,Design Patterns: Elements of Reusable Object Oriented Code, Addison-Wesley Publishers, 1995, pp. 315-323.
Bjorn N. Freeman-Benson et al., “An Incremental Constraint Solver”, Communications of the ACM, Jan. 1990, vol. 33, No. 1, pp. 54-63.
Eugene C. Freuder et al., “Partial constraint satisfaction”, Artificial Intelligence 58 (1992), pp. 21-70.
LandOfFree
Dynamically varying policy driven print engine does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Dynamically varying policy driven print engine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamically varying policy driven print engine will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3037700