Print engine scheduling method and apparatus

Details Print engine scheduling method and apparatus Print engine scheduling method and apparatus

2005-02-01

2005-02-01

Lamb, Twyler (Department: 2622)

Facsimile and static presentation processing

Static presentation processing

Communication

C358S001160, C358S001170

Reexamination Certificate

active

06850336

ABSTRACT:
A method of scheduling jobs in a printing machine includes choosing configuration and selection policies and model and store traversers from a library based on a model of the machine, traversing the model of the machine to prepare and store a list of valid itineraries based on the configuration policies and traversing the stored list of valid itineraries to locate a valid itinerary to process a job. An itinerary is a schedule of the printer modules and capabilities through which a sheet must pass to perform a print job. The step of traversing the model of the machine includes evaluating all possible itineraries to preparing the list of valid itineraries based on the configuration policies and storing the list in a memory. The step of traversing the stored list of valid itineraries to locate the valid itinerary to process a job includes evaluating the list based on the selection policies and the job description.

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
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.
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 Satsifaction 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.

Affiliated with

Also associated with

Rating

Print engine scheduling method and apparatus 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 scheduling method and apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Print engine scheduling method and apparatus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3502289