System and method for processing multiple mailing services orders of varying quantities and address lists
First Claim
1. A method for processing multiple mailing services orders for print items of varying quantities, the multiple orders each specifying a respective print item, a respective list of addresses, a respective specified quantity to be printed, and a respective order identifier, and having associated therewith an active quantity initialized to the same number as the respective specified quantity to be printed, the method comprising the steps of:
- generating a gang file, the gang file comprising a plurality of empty cells organized in a 3-dimensional grid, wherein at least one dimension corresponds to pages to be printed on a substrate and the other two dimensions correspond to positions of individual stacks to be printed;
obtaining a stack identifier corresponding to an unfilled stack having available empty content slots in the gang file;
determining a current number of available slots in the stack identified by the stack identifier;
receiving an open order having a non-zero active quantity;
creating a new fulfillment item identifier and associating the new fulfillment item identifier with the stack identifier;
determining whether the active quantity associated with the open order is less than or equal to the current number of available slots in the stack identified by the stack identifier;
if the active quantity associated with the open order is less than or equal to the current number of available slots in the stack identified by the stack identifier, obtaining a quantity of addresses associated with the mailing list associated with the open order in a quantity equal to the active quantity associated with the open order, rendering a quantity of individual print-ready files containing the print item associated with the open order with each individual print-ready file containing a different one of the obtained addresses, associating the addresses and order identifier with the fulfillment item identifier, and inserting the individual print-ready files into respective empty cells of the gang within the stack identified by the stack identifier;
if the active quantity associated with the open order is greater than the current number of available slots in the stack identified by the stack identifier, obtaining a quantity of addresses associated with the mailing list associated with the open order in a quantity equal to the current number of available slots, rendering a quantity of individual print-ready files containing the print item associated with the open order with each individual print-ready file containing a different one of the obtained addresses, associating the addresses and order identifier with the fulfillment item identifier, and inserting the individual print-ready files into respective empty cells of the gang within the stack identified by the stack identifier;
reducing the active quantity associated with the open order by a number equal to the quantity of obtained addresses; and
repeating the obtaining step through the reducing step until the existence of at least one of the gang file is filled, no more open orders are available, or a predetermined period of time passes.
5 Assignments
0 Petitions
Accused Products
Abstract
Methods and systems for processing multiple mailing services orders for print items of varying quantities include filling 3-dimensional gangs configured to receive print-ready items with print-ready items in a stack-wise manner. Individual stacks can be submitted to the system for reprint without holding up remaining items in an order.
12 Citations
12 Claims
-
1. A method for processing multiple mailing services orders for print items of varying quantities, the multiple orders each specifying a respective print item, a respective list of addresses, a respective specified quantity to be printed, and a respective order identifier, and having associated therewith an active quantity initialized to the same number as the respective specified quantity to be printed, the method comprising the steps of:
-
generating a gang file, the gang file comprising a plurality of empty cells organized in a 3-dimensional grid, wherein at least one dimension corresponds to pages to be printed on a substrate and the other two dimensions correspond to positions of individual stacks to be printed; obtaining a stack identifier corresponding to an unfilled stack having available empty content slots in the gang file; determining a current number of available slots in the stack identified by the stack identifier; receiving an open order having a non-zero active quantity; creating a new fulfillment item identifier and associating the new fulfillment item identifier with the stack identifier; determining whether the active quantity associated with the open order is less than or equal to the current number of available slots in the stack identified by the stack identifier; if the active quantity associated with the open order is less than or equal to the current number of available slots in the stack identified by the stack identifier, obtaining a quantity of addresses associated with the mailing list associated with the open order in a quantity equal to the active quantity associated with the open order, rendering a quantity of individual print-ready files containing the print item associated with the open order with each individual print-ready file containing a different one of the obtained addresses, associating the addresses and order identifier with the fulfillment item identifier, and inserting the individual print-ready files into respective empty cells of the gang within the stack identified by the stack identifier; if the active quantity associated with the open order is greater than the current number of available slots in the stack identified by the stack identifier, obtaining a quantity of addresses associated with the mailing list associated with the open order in a quantity equal to the current number of available slots, rendering a quantity of individual print-ready files containing the print item associated with the open order with each individual print-ready file containing a different one of the obtained addresses, associating the addresses and order identifier with the fulfillment item identifier, and inserting the individual print-ready files into respective empty cells of the gang within the stack identified by the stack identifier; reducing the active quantity associated with the open order by a number equal to the quantity of obtained addresses; and repeating the obtaining step through the reducing step until the existence of at least one of the gang file is filled, no more open orders are available, or a predetermined period of time passes. - View Dependent Claims (2, 3)
-
-
4. A method for processing mailing services orders, the method comprising the steps of:
-
accessing an unfilled gang by one or more processors, the unfilled gang having associated therewith a gang identifier, the unfilled gang comprising a plurality of uniquely identifiable cells laid out in a 3-dimensional grid, the grid partitioned into a plurality of individual stacks of cells, each stack identified by a corresponding stack identifier which corresponds to a unique position along a first and second dimension and each stack comprising all cells along the third dimension of the grid corresponding to the unique position of the stack in the first and second dimension, wherein each cell is configured to receive for insertion therein content corresponding to an individual print item to be printed, receiving by one or more processors an unprocessed order, the order having associated thereto a respective print item, a respective list of addresses, and a respective order identifier, selecting a stack identifier corresponding to an unfilled stack in the unfilled gang, the unfilled stack having cells that do not yet contain a print item; determining the number of cells in the unfilled stack that are unfilled; receiving a number of print items each uniquely rendered to combine the print item associated with the unprocessed order with a respective corresponding unique address from the list of addresses associated with the unprocessed order, the number of print items equal to or less than the determined number of unfilled cells in the unfilled stack; inserting the received number of print items stackwise into cells corresponding to the selected stack identifier; associating the order identifier and the unique addresses from the number of print items with a respective fulfillment identifier; associating the respective fulfillment identifier with the gang identifier, the selected stack identifier; if all the addresses in the list of addresses associated with the unprocessed order are associated with a fulfillment identifier, updating the unprocessed order to a processed order; if the unfilled gang contains no unfilled stacks, updating the gang to a filled gang; if the gang remains unfilled and the unprocessed order has not been updated to a processed order, repeating the selecting step through this present step until the unprocessed order is updated to a processed order or the unfilled gang becomes filled. - View Dependent Claims (5, 6, 7)
-
-
8. A print order processing system, comprising:
-
at least one ganging processor accessing an unfilled gang, the unfilled gang having associated therewith a gang identifier, the unfilled gang comprising a plurality of uniquely identifiable cells laid out in a 3-dimensional grid, the grid partitioned into a plurality of individual stacks of cells, each stack identified by a corresponding stack identifier which corresponds to a unique position along a first and second dimension and each stack comprising all cells along the third dimension of the grid corresponding to the unique position of the stack in the first and second dimension, wherein each cell is configured to receive for insertion therein content corresponding to an individual print item to be printed, the at least one ganging processor receiving an unprocessed order, the order having associated thereto a respective print item, a respective list of addresses, and a respective order identifier, the at least one ganging processor selecting a stack identifier corresponding to an unfilled stack in the unfilled gang, the unfilled stack having cells that do not yet contain a print item; the at least one ganging processor determining the number of cells in the unfilled stack that are unfilled; the at least one ganging processor receiving a number of uniquely rendered print items each uniquely rendered to combine the print item associated with the unprocessed order with a respective corresponding unique address from the list of addresses associated with the unprocessed order, the number of uniquely rendered print items equal to or less than the determined number of unfilled cells in the unfilled stack; the at least one ganging processor inserting the received uniquely rendered print items stackwise into cells corresponding to the selected stack identifier; the at least one ganging processor associating the order identifier and the unique addresses incorporated into the uniquely rendered print items with a respective fulfillment identifier; the at least one ganging processor associating the respective fulfillment identifier with the gang identifier and the selected stack identifier; the at least one ganging processor updating the unprocessed order to a processed order if all the addresses in the list of addresses associated with the unprocessed order are associated with a fulfillment identifier; the at least one ganging processor updating the gang to a filled gang if the unfilled gang contains no unfilled stacks; the at least one ganging processor repeating the selecting step through this present step until the unprocessed order is updated to a processed order or the unfilled gang is updated to becomes a filled gang. - View Dependent Claims (9, 10, 11, 12)
-
Specification