A two-phase heuristic algorithm for the label printing problem

DOI10.1007/s11750-022-00624-6OpenAlexW4214806584MaRDI QIDQ2701173

Okan Örsan Özener, Emre Çankaya, Ali Ekici

Publication date: 27 April 2023

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-022-00624-6

zbMATH Keywords

set coveringconstruct-improve heuristiclabel printing problemmixed-integer linear model

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Ad hoc heuristic for the cover printing problem
• Stop location design in public transportation networks: covering and accessibility objectives
• A heuristic for the label printing problem
• Genetic algorithms to solve the cover printing problem
• An application of the greedy heuristic of set cover to traffic checks
• 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
• Optimal job splitting on a multi-slot machine with applications in the printing industry

This page was built for publication: A two-phase heuristic algorithm for the label printing problem