Optimal job splitting on a multi-slot machine with applications in the printing industry
From MaRDI portal
Publication:3553743
DOI10.1002/nav.20396zbMath1184.90059OpenAlexW2057980201MaRDI QIDQ3553743
Michail G. Lagoudakis, Pinar Keskinocak, Özlem Ergun, Ali Ekici
Publication date: 21 April 2010
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20396
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Minimizing setups and waste when printing labels of consumer goods ⋮ Two heuristics for the label printing problem ⋮ Ad hoc heuristic for the cover printing problem ⋮ A two-phase heuristic algorithm for the label printing problem ⋮ A hybrid simulated annealing/linear programming approach for the cover printing problem ⋮ Towards an efficient resolution of printing problems
Cites Work
- Cutting stock problems and solution procedures
- Setup minimising conditions in the trim loss problem
- A typology of cutting and packing problems
- One-dimensional cutting stock problem to minimize the number of different patterns
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
- Pattern minimisation in cutting stock problems
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Scheduling Solutions for the Paper Industry
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Pattern reduction in one-dimensional cutting stock problems
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
This page was built for publication: Optimal job splitting on a multi-slot machine with applications in the printing industry
