| 摘要 |
PROBLEM TO BE SOLVED: To rapidly obtain an optimum sheet carrying route by not crossing a sheet across a plurality of sheet carrying routes obtained based on printing conditions to be input by input units, and evaluating a combination of units based on weighting according to a condition that the route of the sheet is shortest. SOLUTION: When five sheet feeders 21f to 25f are corresponded to printing unit 33p, the feeder 22f is nearest and the feeder 25f is farthest. This means that the feeder 22f has largest weight and the feeder 25f has lightest weight. That is, as to the unit 33p, sheet is supplied from the feeder 22f as much as possible, and hence waste sheets are reduced, a sheet length is short, and tension change is minimized, thereby obtaining stable printing. Previously indicated decided route, i.e., the shortest route is adopted. The route is weighted by selecting the route where the sheet is not crossed, and a sheet carrying route is decided by an arithmetic unit based on it. |
