Abstract: A method of generating a comparison of optimal sheet scheduling to greedy sheet scheduling, the method comprising receiving, by one or more computer processors, one or more print requests, generating, by the one or more computer processors, a greedy finite state machine based on the one or more print requests, generating, by the one or more computer processors, an optimal finite state machine based on the one or more print requests, generating, by the one or more computer processors, a cross product of the optimal finite state machine and the greedy finite state machine, identifying, by the one or more computer processors, a cycle in the cross product, and generating, by the one or more computer processors, a minimum ratio of optimal cost to greedy cost.

Abstract: A method of generating a comparison of optimal sheet scheduling to greedy sheet scheduling, the method comprising receiving, by one or more computer processors, one or more print requests, generating, by the one or more computer processors, a greedy finite state machine based on the one or more print requests, generating, by the one or more computer processors, an optimal finite state machine based on the one or more print requests, generating, by the one or more computer processors, a cross product of the optimal finite state machine and the greedy finite state machine, identifying, by the one or more computer processors, a cycle in the cross product, and generating, by the one or more computer processors, a minimum ratio of optimal cost to greedy cost.

Abstract: A method of operating a printing system according to a printing path schedule, the printing system including a duplex loop including a plurality of pitches with each pitch of the plurality of pitches operatively arranged to carry one sheet, the method including receiving input data related to one or more images to be printed, preparing a printing path schedule based on the input data, receiving an indication of the delay in the printing system, determining whether the delay is equal to a multiple of a whole pitch of the plurality of pitches, and if the delay is not equal to a multiple of a whole pitch of the plurality of pitches, adjusting the printing path schedule.

Abstract: Methods and devices receive scheduling constraints for sheets of print media being processed as a print job through a printing device, and prepare a timing schedule for each of the sheets of print media based on the scheduling constraints. The timing schedule determines a location of each of the sheets of print media relative to the processing components of the printing device and relative to a linear time scale. Such methods and devices augment the timing schedule to produce an augmented timing schedule by adding explanatory text to the timing schedule, and receive user input selecting a portion of the augmented timing schedule. In response to the user input that selects a portion of the augmented timing schedule, the methods and devices output corresponding portions of the explanatory text that correspond to a location on the linear time scale represented by the selected portion of the augmented timing schedule.

Abstract: Methods and devices receive scheduling constraints for sheets of print media being processed as a print job through a printing device, and prepare a timing schedule for each of the sheets of print media based on the scheduling constraints. The timing schedule determines a location of each of the sheets of print media relative to the processing components of the printing device and relative to a linear time scale. Such methods and devices augment the timing schedule to produce an augmented timing schedule by adding explanatory text to the timing schedule, and receive user input selecting a portion of the augmented timing schedule. In response to the user input that selects a portion of the augmented timing schedule, the methods and devices output corresponding portions of the explanatory text that correspond to a location on the linear time scale represented by the selected portion of the augmented timing schedule.

Abstract: Programming of the input and output paper handling setup of a high speed reprographic system can adversely affect the throughput of the system. A method or system includes a control system that examines the proposed setup and then determine if any of these options results in a loss of throughput. If such losses are detected and exceed a predetermined threshold, the operator of the device will be informed and given the opportunity to change the setup to reduce the throughput loss.

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.

Abstract: A scheduler for a machine 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. Alternatively, the traverser includes a search algorithm shell and a plurality of search algorithm fragments that are selected by the selector from a search algorithm library based on a strategy design pattern so that the traverser is abstracted from dependence on any particular search algorithm shell and from dependence on any particular search algorithm fragment.

Abstract: 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.

Abstract: 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.

Abstract: 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.