Two heuristics for the label printing problem

DOI10.1111/itor.13036OpenAlexW3191573427MaRDI QIDQ6082184

Unnamed Author, Unnamed Author, Federico Alonso-Pecina

Publication date: 29 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13036

zbMATH Keywords

combinatorial optimizationtabu searchthreshold acceptingcover printinglabel printing

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Ad hoc heuristic for the cover printing problem
• A heuristic for the label printing problem
• Genetic algorithms to solve the cover printing problem
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Using a greedy random adaptative search procedure to solve the cover printing problem
• A hybrid simulated annealing/linear programming approach for the cover printing problem
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
• Towards an efficient resolution of printing problems
• An optimization model to determine master designs and runs for advertisement printing
• Metaheuristics
• Optimal job splitting on a multi-slot machine with applications in the printing industry
• Tabu Search—Part I
• Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment