An Optimization Model to Determine Master Designs and Runs for Advertisement Printing

A Hybrid Simulated Annealing/Linear Programming Approach for the Cover Printing Problem

“…This is to say, solution 0 consists of three grids (columns 1, 2, and 5 of 0 ), imprinted 11, 36, and 7 times, respectively, yielding ( 0 ) = 354. Taking 0 as input, the procedure resize produceŝ, (̂) = (10,20,4,9), and (̂) = 443. Then, from̂and after a few iterations, salp successively obtains * , ( * ) = (44, 12), * = ( * , ( * )), and ( * ) = 256, which turns out to be the global optimum of the toy example.…”

“…This paper deals with a scheduling problem motivated by the printing industry. We will refer to it as the cover printing problem, although including its variants is also known as the job splitting [1], the label printing [2,3], and the advertisement printing [4] problem.…”

“…Besides a handful of graduate thesis (namely, four Belgian graduate thesis cited in [6][7][8], not available to the authors, and the Latin American graduate thesis by Calderón [9] and Carrera [10]) few internationally published papers have studied heuristic approaches for this highly combinatorial problem and its variants. These approaches are assorted, going from simulated annealing (Teghem et al [7], Yiu et al [3]) to GRASP (Tuyttens & Vandaele [8,11]), as well as from evolutionary algorithms (Elaoud et al [6], Hsieh et al [2]) to ad hoc heuristics (Ekici et al [1], Mohan et al [4], and Romero & Alonso-Pecina [5]).…”

“…Romero & Alonso-Pecina [5] proposed to add a Hamiltonian path procedure to their ad hoc heuristic when there is also a cost for each produced plate. Other variants consist in the inclusion of additional constraints: while Mohan et al [4] tackle the case of lower and upper bounds on the number of imprints made with each grid, Yiu et al [3] and Mohan et al [4] assume the number of grids as prescribed. Finally, Yiu et al [3], Hsieh et al [2], and Tuyttens & Vandaele [11] consider the constraint that all copies of any cover should be produced by one single grid.…”

Planning of a make-to-order production process in the printing industry

“…In this problem, the number of rotations is prescribed, not every slot must by occupied by an item, and the number of different item colors per plate is limited from above. Mohan et al (2007) present a non-linear integer programming formulation and three specific constructive heuristics for an advertisement printing problem, which corresponds to a cover-printing problem with additional bounds on the number of rotations of each plate. Yiu et al (2007) propose a two-level heuristic for the label-printing problem, which is another variant of the cover-printing problem in which empty slots are allowed, but penalized in the objective function.…”