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.