# US 2009/0268232 A1 · Digital printing system having optimized paper usage

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2009/0268232 A1
- Document ID: US20090268232A1
- Status: Published application
- Kind: A1
- Application number: 12/109,523
- Filed: 2008-04-25
- Published: 2009-10-29
- Earliest claimed: 2008-04-25
- Assignees: Shutterfly, Inc.
- Inventors: Kenneth Ray Niblett, JR.
- Web page: https://patentgrep.com/patent/US20090268232A1

## CPC

- G06F 3/1214: {at the submitting node}
- G06F 3/1208: {resulting in improved quality of the output result, e.g. print layout, colours, workflows, print preview}
- G06F 3/1262: {by grouping or ganging jobs}
- G06F 3/1272: {Digital storefront, e.g. e-ordering, web2print, submitting a job from a remote submission screen}
- G06F 3/1288: {in client-server-printer device configuration}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for manufacturing printed page products includes defining a plurality of subbatches each comprising one or more of the pages, creating layouts for the pages in the plurality of subbatches, separating the plurality of subbatches into N groups each comprising a total number of pages equal or less than M, minimizing the difference between the total pages in the N groups and M×N, and printing the layouts of the pages on a stack of sheets each configured to contain layouts for N pages. The layouts of the pages in the stack of sheets are positioned in N columns.

## Claims

### Claim 1

A method for manufacturing printed page products, comprising:
defining a plurality of subbatches each comprising one or more of the pages;
creating layouts for the pages in the plurality of subbatches;
separating the plurality of subbatches into N groups each comprising a total number of pages equal or less than M;
minimizing the difference between the total pages in the N groups and M×N; and
printing the layouts of the pages on a stack of sheets each configured to contain layouts for N pages, wherein the layouts of the pages in the stack of sheets are positioned in N columns.

### Claim 2 (depends on 1)

The method of claim 1, wherein the layouts in at least one of the N columns have substantially the same lateral dimensions.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
determining which of the N groups has the highest page number; and
assigning the highest page number as maximum stack number.

### Claim 4 (depends on 1)

The method of claim 1, further comprising inserting blank pages into one or more of the N groups to make the pages in the N groups all equal to the maximum stack number.

### Claim 5 (depends on 1)

The method of claim 1, further comprising: if pages in the one of the plurality of subbatches are more than M, breaking the one of the plurality of subbatches into two or more subbatches before the step of separating.

### Claim 6 (depends on 1)

The method of claim 1, wherein the step of creating layouts comprises:
receiving content from one or more user(s); and
incorporating the content in the layouts.

### Claim 7 (depends on 6)

The method of claim 6, wherein the content comprises text and image.

### Claim 8 (depends on 6)

The method of claim 6, further comprising receiving the content over a computer network.

### Claim 9 (depends on 1)

The method of claim 1, wherein the step of printing comprises printing the layouts of the pages on the stack of sheets using a digital printer or a digital press.

### Claim 10 (depends on 1)

The method of claim 1, wherein N is selected from the group consisting of two, three, four, five, and six.

### Claim 11 (depends on 1)

The method of claim 1, wherein M is bigger than 10.

### Claim 12 (depends on 1)

The method of claim 1, wherein the step of minimizing comprises sequencing the plurality of subbatches according to numbers of pages in the associated subbatches.

### Claim 13 (depends on 12)

The method of claim 12, wherein the step of minimizing comprises sequencing the plurality of subbatches in an ascending order or a descending order for the numbers of pages in the associated subbatches.

### Claim 14 (depends on 1)

The method of claim 1, further comprising cutting the stack of sheets to N stacks each comprising pages associated with the plurality of subbatches.

### Claim 15 (depends on 1)

The method of claim 1, wherein the step of minimizing comprises:
separating the plurality of subbatches into the N groups using two or more algorithms selected from a group consisting of First Fit, Best Fit, Worse Fit, and Almost Worse Fit; and
selecting the two or more algorithms to minimizing the difference between the total pages in the N groups and M×N.

### Claim 16 (depends on 1)

The method of claim 1, wherein the step of minimizing comprises successively assigning the plurality of subbatches into the N groups.

### Claim 17 (depends on 16)

The method of claim 16, wherein the step of successively assigning comprises:
determining an emptiest group in the N group, wherein the emptiest group includes the least number of pages in its associated subbatches;
determining an unassigned subbatch in the plurality of subbatches, wherein the unassigned subbatch is not yet assigned to any of the N groups; and
assigning one of the unassigned subbatch into the emptiest group.

### Claim 18 (depends on 16)

The method of claim 16, wherein the step of successively assigning comprises:
determining a second emptiest group in the N group, wherein the second emptiest group includes the second least number of pages in its associated subbatches;
determining an unassigned subbatch in the plurality of subbatches, wherein the unassigned subbatch is not yet assigned to any of the N groups; and
assigning one of the unassigned subbatch into the second emptiest group.

### Claim 19 (depends on 16)

The method of claim 16, wherein the step of successively assigning comprises:
determining a fullest group in the N group, wherein the fullest group includes the most number of pages in its associated subbatches;
determining an unassigned subbatch in the plurality of subbatches, wherein the unassigned subbatch is not yet assigned to any of the N groups; and
assigning one of the unassigned subbatch into the fullest group.

### Claim 20 (depends on 16)

The method of claim 16, wherein the step of successively assigning comprises:
determining a second fullest group in the N group, wherein the second fullest group includes the second most number of pages in its associated subbatches;
determining an unassigned subbatch in the plurality of subbatches, wherein the unassigned subbatch is not yet assigned to any of the N groups; and
assigning one of the unassigned subbatch into the second fullest group.

### Claim 21

A computer-readable storage medium storing a computer program comprising instructions to perform a method for manufacturing printed page products, wherein the method comprises:
defining a plurality of subbatches each comprising one or more of the pages;
creating layouts for the pages in the plurality of subbatches;
separating the plurality of subbatches into N groups each comprising a total number of pages equal or less than M;
minimizing the difference between the total pages in the N groups and M×N; and
printing the layouts of the pages on a stack of sheets each configured to contain layouts for N pages, wherein the layouts of the pages in the stack of sheets are positioned in N columns.

### Claim 22 (depends on 21)

The computer-readable storage medium of claim 21, wherein the layouts in at least one of the N columns have substantially the same lateral dimensions.

### Claim 23 (depends on 21)

The computer-readable storage medium of claim 21, wherein the method further comprises:
determining which of the N groups has the highest page number; and
assigning the highest page number as maximum stack number.

### Claim 24 (depends on 21)

The computer-readable storage medium of claim 21, wherein the method further comprises inserting blank pages into one or more of the N groups to make the pages in the N groups all equal to the maximum stack number.

### Claim 25 (depends on 21)

The computer-readable storage medium of claim 21, wherein the method further comprises: if pages in the one of the plurality of subbatches are more than M, breaking the one of the plurality of subbatches into two or more subbatches before the step of separating.

### Claim 26 (depends on 21)

The computer-readable storage medium of claim 21, wherein the step of creating layouts comprises:
receiving content from one or more user(s); and
incorporating the content in the layouts.

### Claim 27 (depends on 26)

The computer-readable storage medium of claim 26, wherein the content comprises text and image.

### Claim 28 (depends on 26)

The computer-readable storage medium of claim 26, wherein the method further comprises receiving the content over a computer network.

### Claim 29 (depends on 21)

The computer-readable storage medium of claim 21, wherein the step of printing comprises printing the layouts of the pages on the stack of sheets using a digital printer or a digital press.

### Claim 30 (depends on 21)

The computer-readable storage medium of claim 21, wherein N is selected from the group consisting of two, three, four, five, and six.

### Claim 31 (depends on 21)

The computer-readable storage medium of claim 21, wherein M is bigger than 10.

### Claim 32 (depends on 21)

The computer-readable storage medium of claim 21, wherein the step of minimizing comprises sequencing the plurality of subbatches according to numbers of pages in the associated subbatches.

### Claim 33 (depends on 32)

The computer-readable storage medium of claim 32, wherein the step of minimizing comprises sequencing the plurality of subbatches in an ascending order or a descending order for the numbers of pages in the associated subbatches.

### Claim 34 (depends on 31)

The computer-readable storage medium of claim 31, wherein the method further comprises cutting the stack of sheets to N stacks each comprising pages associated with the plurality of subbatches.

### Claim 35 (depends on 34)

The computer-readable storage medium of claim 34, wherein the step of minimizing comprises:
separating the plurality of subbatches into the N groups using two or more algorithms selected from a group consisting of First Fit, Best Fit, Worse Fit, and Almost Worse Fit; and
selecting the two or more algorithms to minimizing the difference between the total pages in the N groups and M×N.

### Claim 36 (depends on 31)

The computer-readable storage medium of claim 31, wherein the step of minimizing comprises successively assigning the plurality of subbatches into the N groups.

### Claim 37 (depends on 36)

The computer-readable storage medium of claim 36, wherein the step of successively assigning comprises:
determining an emptiest group in the N group wherein the emptiest group includes the least number of pages in its associated subbatches;
determining an unassigned subbatch in the plurality of subbatches, wherein the unassigned subbatch is not yet assigned to any of the N groups; and
assigning one of the unassigned subbatch into the emptiest group.

### Claim 38 (depends on 36)

The computer-readable storage medium of claim 36, wherein the step of successively assigning comprises:
determining a second emptiest group in the N group, wherein the second emptiest group includes the second least number of pages in its associated subbatches;
determining an unassigned subbatch in the plurality of subbatches, wherein the unassigned subbatch is not yet assigned to any of the N groups; and
assigning one of the unassigned subbatch into the second emptiest group.

### Claim 39 (depends on 36)

The computer-readable storage medium of claim 36, wherein the step of successively assigning comprises:
determining a fullest group in the N group, wherein the fullest group includes the most number of pages in its associated subbatches;
determining an unassigned subbatch in the plurality of subbatches, wherein the unassigned subbatch is not yet assigned to any of the N groups, and
assigning one of the unassigned subbatch into the fullest group.

### Claim 40 (depends on 36)

The computer-readable storage medium of claim 36, wherein the step of successively assigning comprises:
determining a second fullest group in the N group, wherein the second fullest group includes the second most number of pages in its associated subbatches;
determining an unassigned subbatch in the plurality of subbatches, wherein the unassigned subbatch is not yet assigned to any of the N groups; and
assigning one of the unassigned subbatch into the second fullest group.

### Claim 41

A method for manufacturing printed page products, comprising:
defining a plurality of subbatches each comprising one or more of the pages;
creating layouts for the pages in the plurality of subbatches;
separating the plurality of subbatches into N groups each comprising a total number of pages equal or less than M;
successively assigning the plurality of subbatches into the N groups;
determining an emptiest group, a second emptiest group, a fullest group, or a second fullest group in the N group, wherein the emptiest group includes the least number of pages in its associated subbatches, wherein the second emptiest group includes the second least number of pages in its associated subbatches, wherein the fullest group includes the most number of pages in its associated subbatches, wherein the second fullest group includes the second most number of pages in its associated subbatches;
determining an unassigned subbatch in the plurality of subbatches, wherein the unassigned subbatch is not yet assigned to any of the N groups;
assigning one of the unassigned subbatch into the emptiest group, the second emptiest group, the fullest group, or the second fullest group to minimize the difference between the total pages in the N groups and M×N; and
printing the layouts of the pages on a stack of sheets each configured to contain layouts for N pages, wherein the layouts of the pages in the stack of sheets are positioned in N columns.

### Claim 42 (depends on 41)

The method of claim 41, further comprising cutting the stack of sheets to N stacks each comprising pages associated with the plurality of subbatches.