Print sequence scheduling system for duplex printing apparatus

Claim 2

In a simplex-duplex printer comprising an imager for creating images on a side of a sheet, and an inverter for inverting the sheet to enable the imager to create an image on another side of the sheet to make a duplex print, the inverter including a duplex loop for temporarily retaining the sheet, a method for scheduling a sequence of images created by the imager, comprising the steps of: providing a data structure including a schedule having a plurality of pitch spaces; for each simplex print to be made by the printer, entering into a pitch space in the schedule a simplex block representative of the creation of the simplex print; for each duplex print to be made by the printer, entering into pitch spaces in the schedule a duplex block representative of the creation of the duplex print, the duplex block comprising a front block representative of the creation of a first side of the duplex print and an end block representative of the creation of a second side of the duplex print, the front block and end block of each duplex block being spaced by a predetermined number of pitch spaces; organizing a plurality of simplex blocks and duplex blocks within the schedule so that a sequence of simplex blocks and end blocks corresponds to a desired sequence of simplex and duplex prints in a job; and optimizing the sequence of simplex blocks and end blocks to minimize a number of blank pitch spaces within the schedule.

Claim 3

The method of claim 1, the optimizing step including the steps of accumulating in the schedule a list of simplex and duplex prints to be made in a forward sequence; and for a predetermined number of pitch spaces at the end of the forward sequence, selecting an arrangement of blocks, corresponding to the list of simplex and duplex prints, which minimize a number of empty pitch spaces within the predetermined number of pitch spaces to yield a reach-back sequence.

Claim 4

The method of claim 2, the optimizing step further including the steps of providing a transition table, the transition table being a table of possible new end sequences of the predetermined number of pitch spaces at the end of the forward sequence, each new end sequence resulting from addition of either a simplex block or a duplex block to a previous end sequence; and for each new print accumulated in the schedule, adding an appropriate simplex or duplex block to a current end sequence in the transition table, to yield a new end sequence of the predetermined number of pitch spaces.

Claim 5

The method of claim 3, the step of selecting an arrangement of blocks further including the steps of for each new print accumulated in the schedule, entering the current end sequence of the predetermined number of pitch spaces at the end of the forward sequence into the transition table, and retaining in a memory all possible new end sequences from the transition table; selecting, from the set of all possible new end sequences for each new print accumulated in the schedule, a series of end sequences which collectively minimizes a number of empty pitch spaces over a plurality of prints to be made.

Claim 6

The method of claim 3, the step of providing a transition table including the steps of generating a pattern list of physically permissible end sequences of blocks within a predetermined number of pitch spaces; adding one of a simplex block or a duplex block to each of the possible end sequences of blocks in the pattern list, thereby yielding a new end sequence; and identifying each new end sequence with an identical end sequence in the pattern list, thereby yielding a transition table in a form of a closed system.

Claim 7

The method of claim 2, the optimizing step further including the steps of for each print accumulated in the schedule, adding a simplex block or duplex block as required at the end of the schedule in a manner which minimizes a number of empty pitch spaces added to the schedule, to yield a greedy-algorithm sequence; for a predetermined number of pitch spaces at the end of the forward sequence, counting a number of empty pitch spaces in the greedy-algorithm sequence and in the reach-back sequence; and when the number of empty pitch spaces in the greedy-algorithm sequence is greater than in the reach-back sequence, operating the printer according to the reach-back sequence, and otherwise operating the printer according to the greedy-algorithm sequence.

Claim 8

The method of claim 1, the optimizing step further including the step of for each print accumulated in the schedule, adding a simplex block or duplex block as required at the end of the schedule in a manner which minimizes a number of empty pitch spaces added to the schedule to yield a greedy-algorithm sequence.

Claim 9

The method of claim 1, the optimizing step including the steps of accumulating in the schedule a list of simplex and duplex prints to be made in a backward sequence from an end of a job; and for each print accumulated in the backward sequence, adding a simplex block or duplex block as required at the beginning of the backward sequence in a manner which minimizes a number of empty pitch spaces added to the schedule.

Claim 10

The method of claim 1, the organizing step including the step of avoiding successions of blocks within the schedule which are physically impermissible in the printer.

Claim 11

The method of claim 1, wherein the data structure is organized as a set of time units, and each simplex block and duplex block is construed as occupying a predetermined number of time units within the data structure, the number of time units associated with each simplex block and duplex block being related to the size of an image to be printed.

Claim 12

In a simplex-duplex printer comprising an imager for creating images on a side of a sheet, and an inverter for inverting the sheet to enable the imager to create an image on another side of the sheet to make a duplex print, the inverter including a duplex loop for temporarily retaining the sheet, a method for scheduling a sequence of images created by the imager, comprising the steps of: providing a data structure including a schedule having a plurality of pitch spaces; for each simplex print to be made by the printer, entering into a pitch space in the schedule a simplex block representative of the creation of the simplex print; for each duplex print to be made by the printer, entering into pitch spaces in the schedule a duplex block representative of the creation of the duplex print, the duplex block comprising a front block representative of the creation of a first side of the duplex print and an end block representative of the creation of a second side of the duplex print, the front block and end block of each duplex block being spaced by a predetermined number of pitch spaces; accumulating a sequence of simplex blocks and end blocks corresponding to a desired sequence of simplex and duplex prints to be made in a forward sequence; providing a transition table, the transition table being a table of possible new end sequences of the predetermined number of pitch spaces at the end of the forward sequence, each new end sequence resulting from addition of either a simplex block or a duplex block to a previous end sequence; and for each new print accumulated in the schedule, adding an appropriate simplex or duplex block to a current end sequence in the transition table, to yield a new end sequence of the predetermined number of pitch spaces.

Claim 13

In a simplex-duplex printer comprising an imager for creating images on a side of a sheet, and an inverter for inverting the sheet to enable the imager to create an image on another side of the sheet to make a duplex print, the inverter including a duplex loop for temporarily retaining the sheet, a method for scheduling a sequence of images created by the imager, comprising the steps of: providing a data structure including a schedule having a plurality of pitch spaces; for each simplex print to be made by the printer, entering into a pitch space in the schedule a simplex block representative of the creation of the simplex print; for each duplex print to be made by the printer, entering into pitch spaces in the schedule a duplex block representative of the creation of the duplex print, the duplex block comprising a front block representative of the creation of a first side of the duplex print and an end block representative of the creation of a second side of the duplex print, the front block and end block of each duplex block being spaced by a predetermined number of pitch spaces; accumulating a sequence of simplex blocks and end blocks corresponding to a desired sequence of simplex and duplex prints to be made in a forward sequence; providing a transition table, the transition table being a table of possible new end sequences of the predetermined number of pitch spaces at the end of the forward sequence, each new end sequence resulting from addition of either a simplex block or a duplex block to a previous end sequence; and for each new print accumulated in the schedule, adding an appropriate simplex or duplex block to a current end sequence in the transition table, to yield a new end sequence of the predetermined number of pitch spaces.

Claim 14

In a printing apparatus for creating monochrome and multicolor prints, the printing apparatus including a rotatable image receptor for accumulating print material in imagewise fashion, a plurality of selectably-actuable development units disposed along a path of the image receptor for dispensing print material onto a latent image created on the image receptor, and an imager disposed along the path of the image receptor for creating latent images on the image receptor, the printing apparatus being controllable to cause the imager to create partial images of a desired multicolor image and to enable print material relating to a plurality of partial images to be superimposed on an image area of the image receptor by causing print material relating to partial images to be retained on the image receptor through a plurality of rotations of the image receptor, a method for scheduling a sequence of latent images created by the imager, comprising the steps of: providing a data structure including a schedule having a plurality of pitch spaces; for each monochrome print to be made by the printer, entering into a pitch space in the schedule a simplex block representative of the creation of the monochrome print; for each multicolor print to be made by the printer, entering into pitch spaces in the schedule a complex block representative of the creation of the multicolor print, the complex block comprising at least a first block representative of the creation of a first partial image of the multicolor print and an end block representative of the creation of a final partial image of the multicolor print, the first block and end block of each complex block being spaced by a predetermined number of pitch spaces; organizing a plurality of simplex blocks and complex blocks within the schedule so that a sequence of simplex blocks and end blocks corresponds to a desired sequence of monochrome and multicolor prints to be output; and optimizing the sequence of simplex blocks and end blocks to minimize a number of blank pitch spaces within the schedule.

Claim 15

In a printing apparatus for creating monochrome and multicolor prints, the printing apparatus including a rotatable image receptor for accumulating print material in imagewise fashion, a plurality of selectably-actuable development units disposed along a path of the image receptor for dispensing print material onto a latent image created on the image receptor, and an imager disposed along the path of the image receptor for creating latent images on the image receptor, the printing apparatus being controllable to cause the imager to create partial images of a desired multicolor image and to enable print material relating to a plurality of partial images to be superimposed on an image area of the image receptor by causing print material relating to partial images to be retained on the image receptor through a plurality of rotations of the image receptor, a method for scheduling a sequence of latent images created by the imager, comprising the steps of: providing a data structure including a schedule having a plurality of pitch spaces; for each monochrome print to be made by the printer, entering into a pitch space in the schedule a simplex block representative of the creation of the monochrome print; for each multicolor print to be made by the printer, entering into pitch spaces in the schedule a complex block representative of the creation of the multicolor print, the complex block comprising at least a first block representative of the creation of a first partial image of the multicolor print and an end block representative of the creation of a final partial image of the multicolor print, the first block and end block of each complex block being spaced by a predetermined number of pitch spaces; organizing a plurality of simplex blocks and complex blocks within the schedule so that a sequence of simplex blocks and end blocks corresponds to a desired sequence of monochrome and multicolor prints to be output; and optimizing the sequence of simplex blocks and end blocks to minimize a number of blank pitch spaces within the schedule.

Claim 16

The method of claim 12, the optimizing step including the steps of accumulating in the schedule a list of prints to be made in a forward sequence; and for a predetermined number of pitch spaces at the end of the forward sequence, selecting an arrangement of blocks, corresponding to the list of prints, which minimize a number of blank pitch spaces within the predetermined number of pitch spaces to yield a reach-back sequence.

Claim 17

The method of claim 13, the optimizing step further including the steps of providing a transition table, the transition table being a table of possible new end sequences of the predetermined number of pitch spaces at the end of the forward sequence, each new end sequence resulting from addition of either a simplex block or a complex block to a previous end sequence; and for each new print accumulated in the schedule, adding an appropriate simplex or complex block to a current end sequence in the transition table, to yield a new end sequence of the predetermined number of pitch spaces.

Claim 18

The method of claim 14, the step of selecting an arrangement of blocks further including the steps of for each new print accumulated in the schedule, entering the current end sequence of the predetermined number of pitch spaces at the end of the forward sequence into the transition table, and retaining in a memory all possible new end sequences from the transition table; selecting, from the set of all possible new end sequences for each new print accumulated in the schedule, a series of end sequences which collectively minimizes a number of blank pitch spaces over a plurality of prints to be made.

Claim 19

The method of claim 14, the step of providing a transition table including the steps of generating a pattern list of physically permissible end sequences of blocks within a predetermined number of pitch spaces; adding one of a simplex block or a complex block to each of the possible end sequences of blocks in the pattern list, thereby yielding a new end sequence; and identifying each new end sequence with an identical end sequence in the pattern list, thereby yielding a transition table in a form of a closed system.

Claim 20

The method of claim 13, the optimizing step further including the steps of for each print accumulated in the schedule, adding a simplex block or complex block as required at the end of the schedule in a manner which minimizes a number of blank pitch spaces added to the schedule, to yield a greedy-algorithm sequence; for a predetermined number of pitch spaces at the end of the forward sequence, counting a number of blank pitch spaces in the greedy-algorithm sequence and in the reach-back sequence; and when the number of blank pitch spaces in the greedy-algorithm sequence is greater than in the reach-back sequence, operating the printer according to the reach-back sequence, and otherwise operating the printer according to the greedy-algorithm sequence.

Claim 21

The method of claim 12, the optimizing step further including the step of for each print accumulated in the schedule, adding a simplex block or complex block as required at the end of the schedule in a manner which minimizes a number of blank pitch spaces added to the schedule.

Claim 22

The method of claim 12, the optimizing step including the steps of accumulating in the schedule a list of monochrome and multicolor prints to be made in a backward sequence from an end of a job; and for each print accumulated in the backward sequence, adding a simplex block or complex block as required at the beginning of the backward sequence in a manner which minimizes a number of blank pitch spaces added to the schedule.

Claim 23

The method of claim 12, the organizing step including the step of avoiding creating within the schedule successions of blocks which are physically impermissible in the printing apparatus.

Claim 24

The method of claim 12, wherein the data structure is organized as a set of time units, and each simplex block and complex block is construed as occupying a predetermined number of time units within the data structure, the number of time units associated with each simplex block and complex block being related to the size of an image to be printed.