2021-04-122017-01-019780983762461SCOPUS;2-s2.0-85030987051http://hdl.handle.net/10784/28527This paper considers a real life application of a printing process in a lithographic company that manufactures food packaging bags. The focus area of this problem is to print a variety of 2D images of bags on a surface area for maximum press layouts, with a constraint that the orientation of all bags is fixed and they should be placed parallel to the edges of the impression material. The problem under study is NP-hard and is an extension of the classical knapsack problem. An algorithm to maximize the number of rectangular images of bags that can be placed within the printing material is proposed. The results were compared with a Particle Swarm Optimization (PSO) metaheuristic. Several numerical experiments show that our procedure outperforms the PSO algorithm and improves the lithography's performance.engInstitute of Industrial EngineersConference PaperBranch and bound methodCombinatorial optimizationEngineersOptimizationPrintingPrinting presses, Impression materialsKnapsackKnapsack problemsNumerical experimentsPrinting materialsPrinting processReal-life applicationsRectangular image, Particle swarm optimization (PSO)2021-04-12Rojas-Santiago M.Barbosa R.C.Muthuswamy S.Hulett M.Velez-Gallego M.C.