Optimal job splitting on a multi-slot machine with applications in the printing industry

DOI10.1002/NAV.20396MaRDI QIDQ3553743zbMATH OpenOpenAlexFDO

Authors Ali Ekici, Özlem Ergun, Pinar Keskinocak, Michail G. Lagoudakis

Publication date 21 April 2010

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.20396

zbMATH Keywords

approximationjob splittingprinting industry

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Minimizing setups and waste when printing labels of consumer goods
• Parallel machine scheduling with splitting jobs
• Publication:4944735
• Lot-sizing scheduling with batch setup times
• Scheduling multi-colour print jobs with sequence-dependent setup times

Cites work

• A Linear Programming Approach to the Cutting-Stock Problem
• A branch-and-price-and-cut algorithm for the pattern minimization problem
• A typology of cutting and packing problems
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• Cutting stock problems and solution procedures
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• One-dimensional cutting stock problem to minimize the number of different patterns
• Pattern minimisation in cutting stock problems
• Pattern reduction in one-dimensional cutting stock problems
• Scheduling Solutions for the Paper Industry
• Setup minimising conditions in the trim loss problem

Cited in

(8)

• Scheduling multi-colour print jobs with sequence-dependent setup times
• Ad hoc heuristic for the cover printing problem
• A two-phase heuristic algorithm for the label printing problem
• Two heuristics for the label printing problem
• A hybrid simulated annealing/linear programming approach for the cover printing problem
• Towards an efficient resolution of printing problems
• An optimization model to determine master designs and runs for advertisement printing
• Minimizing setups and waste when printing labels of consumer goods

This page was built for publication: Optimal job splitting on a multi-slot machine with applications in the printing industry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553743)