Using a greedy random adaptative search procedure to solve the cover printing problem

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

“…Teghem et al (1995) provide a non-linear and a linear programming formulation and a heuristic of the simulated-annealing type. Elaoud et al (2007), Tuyttens and Vandaele (2010), and Romero and AlonsoPecina (2012) propose a genetic algorithm, a greedy random adaptive search procedure and an ad-hoc heuristic, respectively. Peeters and Degraeve (2004) propose a branch-and-price algorithm for the co-printing problem, which is a variant of the cover printing problem.…”

Towards an efficient resolution of printing problems

“…In this example three templates (T = 3) are used, and each template is made of six slots (S = 6). The global list is given by GL = {(1, 10000), (2, 8000), (3, 7200), (4, 6000), (5, 4000), (6, 3600), (7,2000), (8, 1000)}. The following random values are associated to each template n 1 = 3, n 2 = 2, n 3 = 3.…”

“…Part 1: T −j+1 candidate templates (n t ̸ = 0) are build (see lines [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]. In lines 9-14, m t labels are assigned to a candidate template t. In lines 15-22, some labels are eventually removed from the candidate template t in order to be able to split the number of required copies of m t − n t labels.…”

“…We refer to [13,12] for an introduction, [14] for a bibliography and [15,16] for an overview. Based on the success of metaheuristics [17,18], we already proposed a GRASP procedure to solve the cover printing problem [7]. In this paper, we completely redesign the GRASP procedure in order to solve both the label printing and the cover printing problems.…”

“…In [6], a branch and price algorithm is presented but the results are not quite satisfactory since only bounds on the optimal solution are provided. More recently, a GRASP method has been proposed in [7] and an ad hoc original heuristic has been developed in [8].…”