Xerox Corporation

Palo Alto Research Corporation Incorporated

Markus P Fromherz

Vijay A Saraswat

Marc W Webster

John H Conley

Daniel L McCue, Iii

John C Austin

Paul A Rulli

Susan B Layer

Aaron Michael Burry

Robert Michael Lofthus

Eric Scott Hamby

Daniel Gureasko Bobrow

Kristine A German

Timothy G Lindholm

Dusan G Lysy

Stephen P Hoover

Pierre C Berlandier

Sue Layer

James E Reiche

A printing system includes a plurality of printers, at least a first and a second of the plurality of printers printing in a first print modality. A scheduling system schedules printing of a set of pages by the plurality of printers. The set of pages, when assembled, may include pages where a high level of consistency is desired, such as facing pages or pages which are otherwise to be placed in close relationship. The scheduling system includes at least two scheduling modes, a first mode in which a consistency constraint is applied to the set of pages, and a second mode, different from the first mode, in which the consistency constraint is not applied. The printing system is configured for printing the set of pages in accordance with the first mode and in accordance with the second mode.

Printing systems

A scheduling system determines the order of specific operations in a printing apparatus which is capable of outputting simplex or duplex prints. If the actuation of a module associated with the apparatus, such as stapling or switching paper supplies, requires a delay in the operation of the apparatus, this delay is entered as at least one deliberately blank pitch in the schedule. The scheduling system creates a special finite state machine which can take into account delays of arbitrary length caused by the actuation of one or more modules.

Operation scheduling system for a digital printing apparatus, where new

A system is provided for automatically analyzing timing constraints of capabilities, and establishing parameters for automatic generation of finite-state machines which schedule from print engine capabilities. The system generates a finite-state machine which encodes, for each capability, a means by which any given schedule may be extended to one that includes a correct or optimal schedule for that particular capability. The system generates finite-state machines for both forward and backwards scheduling. It is adapted for both greedy and optimal search strategies. The system facilitates selectively leaving classes of constraints for run-time checking in order to reduce a size of a finite-state machine. Finite machines so generated are suitably used with schedulers to alternately control operation of a print engine.

Generic method for automatically generating finite-state machines for

In a system for scheduling a sequence of operations in an apparatus for outputting, for example, simplex and duplex digitally-printed documents, a schedule is derived for obtaining a desired output order of documents, and this schedule is proposed to the apparatus in real time. As individual operations are accepted for execution by the apparatus, the accepted operation is recorded in an execution table. If a proposed operation is rejected by the apparatus, the execution table can be used to revise the schedule quickly to take into account the rejected operation while still obtaining the desired output order.

Operation scheduling system for a digital printing apparatus, using a

A system is provided for generically scheduling operations necessary to produce desired documents on a print engine. Such print engine scheduling employs identifying, sequencing, and initiating print engine operations that will produce a desired document. The system employs a specified description of print engines that enable a scheduler to look up what operations are necessary to produce portions of a document, to find allowable times for those operations, and to send control commands to various print engine components to perform the operations. The system is independent of any particular print engine configuration Thus, it is reusable for a wide range of configurations.

Generic method for scheduling print engines using print engine

A method and apparatus is provided for compositional modeling of print engines. The system automatically derives a complete list of all of the capabilities of a described print engine. The method includes providing compositional models of components forming the print engine. The models describe local capabilities of each component including part transformation abilities as well as timing constraints. Using the component models, configurations are created by connecting the components. Once the component models are connected, the capabilities of the configurations are directly derived. A capability is a part that can be produced by the configuration, together with the itinerary required to produce the part, the inputs from which the output is assembled, and the timing constraints to be observed when executing the itinerary. Capabilities are the fundamental connection between the description of a job to be printed by a print engine and the print engine scheduling and control software. Capabilities are themselves compositional and are used to automatically derive scheduling and control software for customer-configured print engines.

Method for automatically deriving print engine capabilities for

In a scheduling system which optimizes a sequence of operations for carrying out, for example, digital printing of simplex and duplex documents, a 'schedule tree' is created and updated in real time. The schedule tree is a running list of all possible schedules or sequences of operations within a future time frame, given a desired output of documents. Various techniques are used to manage the size of the tree and select schedules from the schedule tree to be proposed to the printing apparatus over time.

Operation scheduling system for a digital printing apparatus using a

An electronic image processing apparatus has a controller and a plurality of resources in an arbitrary configuration. Each of the resources includes an associated processor storing data related to operational constraints of the associated resource and a bus interconnects the processors to the controller for directing the operation of the resources. The controller is adapted to operate independent of a particular configuration of the plurality of resources by receiving from each of the processors the data related to the operational constraints of each associated resource and interrogating each of the processors to determine the geometrical relationship of the interconnection of the resources. The controller then responds to the data related to the operational constraints of each of the processors and to the geometrical relationship of the interconnection of the resources to dynamically configure the image processing apparatus to operate in accordance with the the operational constraints of each of the processors and to the geometrical relationship of the interconnection of the resources.

Machine graphs and capabilities to represent document output terminals

A system is provided to allow for automated scheduling and completion of print jobs in a printing machine. A generic system for describing functionality of various modules forming a print engine is described. Such a module description is provided for each of a plurality of subassemblies which form the printing machine. A component communicates description information about itself to a scheduling unit once it is integrated into a complete printing machine. The scheduling unit, in turn, analyzes all functions available from various subassemblies comprising the machine. This analysis returns data representative of all available functions to the printing machines. Upon receipt of user input on one or more printing jobs, the scheduler then correlates the user information with the available properties of the printing machine to schedule an efficient completing of all printing tasks.

System for generically describing and scheduling operation of modular

A system is provided to allow for automatic configuration of print engine scheduling software in accordance with descriptions of print engine modules. Each point engine module contains a description of itself in a form of module capabilities. When a print engine is formed from such modules, the system composes module capabilities to capabilities of a complete print engine. More particularly, inputs and outputs of capabilities are unified and constraints on their attributes are propagated. This enables derivation of potential outputs of the print engine. The resultant print engine capabilities are directly usable to configure scheduling software. Optionally, the resulting print engine capabilities may be compiled further.

System for automatically configuring print engine software from print

A system is provided to allow for automated scheduling and completion of print jobs in a printing machine. A generic system for describing functionality of various modules forming a print engine is described. Such a module description is provided for each of a plurality of subassemblies which form the printing machine. A component communicates description information about itself to a scheduling unit once it is integrated into a complete printing machine. The scheduling unit, in turn, analyzes all functions available from various subassemblies comprising the machine. This analysis returns data representative of all available functions to the printing machines. Upon receipt of user input on one or more printing jobs, the scheduler then correlates the user information with the available properties of the printing machine to schedule resource allocations to efficiently complete all printing tasks, taking into account dynamic, environmentally-driven allocations.

Generic system for describing and using resources for print engine

Transducers with constraints model for print scheduling

Commitment groups to generalize the scheduling of interdependent

A system dynamically schedules the creation of images in an on-demand printing apparatus outputting simplex and duplex prints. For each simplex print, a simplex print block is appended to a schedule of images to be created, and for each duplex print, a duplex print block is appended to the schedule. The duplex block includes two portions, one portion for each image in the duplex print, separated by a number of pitches which can be occupied by other images. The duplex and simplex blocks are then organized in a manner which preserves the desired final sequence of prints and minimizes the number of unused image pitches in the printing apparatus. The scheduling technique can also be applied to multi-pass color printing.

Growing community of inventors

Palo Alto, CA, United States of America

Markus P Fromherz