Method for automatically determining an imposition plan

• US 7,349,121 B2
• Filed: 07/29/2003
• Issued: 03/25/2008
• Est. Priority Date: 08/02/2002
• Status: Expired due to Fees

• Current Assignee: Agfa Nv (Agfa-Gevaert N.V.)
• Original Assignee: Agfa Graphics Nv (Agfa-Gevaert N.V.)
• Inventors: Dechamps, Jozef
• Primary Examiner(s): Garcia; Gabriel
• Assistant Examiner(s): Pham; Thierry L.
• Application Number:
  US10/629,355
• Publication Number:
  US 20040218217A1
• Time in Patent Office: 1,701 Days
• Field of Search: 358/1.1, 358/1.5, 358/1.9, 358/1.12
• US Class Current: 358/1.5
• CPC Class Codes: G06Q 10/043 Optimisation of two dimensional placement, e.g. cutting of clothes or wood

Abstract

A method for automatically determining an optimal imposition plan for printing and folding a product, the method including (a) calculating a plurality of imposition plans from a given set of input data including product specification data of the product, printing press data of a printing press for printing the product and folding machine data of a folding machine for folding the product and (b) selecting the optimal imposition plan from the plurality of imposition plans.

Claims

1. A method for determininig (i) on a data procesing system, (ii) in a computer program or (iii) on a computer readable medium, an optimal routing for manufacturing a printed product, the method comprising:

selecting a printing device from a first group of printing devices for printing said product, the first group comprising at least one device;

selecting a folding device from a second group of folding devices for folding said product, the second group comprising at least one device;

wherein the first and the second group together comprise at least three devices;

calculating a plurality of imposition plans from a given set of input data including product specification data of said product, printing press data of said selected printing device and folding machine data of said selected folding device;

determining, from said plurality of imposition plans, a specific optimal imposition plan for said product;

repeating said determination of said specific optimal imposition plan for all combinations of printing devices of said first group and folding devices of said second group, thus obtaining a plurality of specific optimal imposition plans for said product;

determining an optimal imposition plan from said plurality of specific optimal imposition plans for said product, thus obtaining said optimal routing for said product, said optimal routing comprising (i) an optimal printing device out of said first group of printing devices and associated with said optimal imposition plan and (ii) an optimal folding device out of said second group of folding devices and associated with said optimal imposition plan.

2. The method according to claim 1 wherein said plurality of imposition plans are all possible imposition plans for said given set of input data.

3. The method according to claim 1 further comprising:

representing each imposition plan of said plurality of imposition plans as a folding formula indicating a folding order of said product and suitable for setting up a folding machine.

4. The method according to claim 1 wherein said plurality of imposition plans are all possible imposition plans for said given set of input data.

5. The method according to claim 1 further comprising:

determining said specific optimal imposition plan from said plurality of imposition plans by means of a selection criterion that is selected from the group consisting of minimum production cost of said product, minimum production time of said product and optimal use of available machinery and resources.

6. The method according to claim 1 further comprising:

representing each imposition plan of said plurality of imposition plans as a folding formula indicating a folding order of said product and suitable for setting up a folding machine.