Print engine scheduler with configurable traverser

Details Print engine scheduler with configurable traverser Print engine scheduler with configurable traverser

1999-08-10

2004-12-28

Lamb, Twyler (Department: 2622)

Facsimile and static presentation processing

Static presentation processing

Communication

C358S001160, C358S001170

Reexamination Certificate

active

06836339

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a scheduler for a printing machine to schedule the processing of sheets through the several modules of the printing machine, the scheduler using a traverser to automatically traverse the machine or a list of itineraries. In particular, the invention includes a selector to configure the traverser so as to adapt to a diverse combination of printer modules and capabilities.
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 tray1 if tray2 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 machine controller with a flexible scheduler for a printing machine that is adaptable to diverse machine configurations and machine environments.
These and other objects are achieved in a scheduler for a machine that includes a selector to select a traverser and to select policies from a library based on a model of the machine and the traverser selected by the selector. The traverser includes a search algorithm that is selected by the selector from a search algorithm library so that the traverser is abstracted from dependence on any particular search algorithm.


REFERENCES:
patent: 5129639 (1992-07-01), DeHority
patent: 5287194 (1994-02-01), Lobiondo
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: 6335795 (2002-01-01), Neuhard et al.
patent: 6614549 (2003-09-01), Hlava
Steven Minton et al., “Minimizing conflicts: a heuristic repair method for constraint satifaction 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”,Principles 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.

Affiliated with

Also associated with

Rating

Print engine scheduler with configurable traverser does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Print engine scheduler with configurable traverser, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Print engine scheduler with configurable traverser will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3299316