Abstract
Offset printing is a common method to produce large amounts of printed matter. We consider a real-world offset printing process that is used to imprint customer-specific designs on napkin pouches. The production equipment used gives rise to various technological constraints. The planning problem consists of allocating designs to printing-plate slots such that the given customer demand for each design is fulfilled, all technological and organizational constraints are met and the total overproduction and setup costs are minimized. We formulate this planning problem as a mixed-binary linear program, and we develop a multi-pass matching-based savings heuristic. We report computational results for a set of problem instances devised from real-world data.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Altinkemer K, Gavish B (1991) Parallel savings based heuristics for the delivery problem. Oper Res 39:456–469
Clarke G, Wright J (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581
Degraeve Z, Vandebroek M (1998) A mixed integer programming model for solving a layout problem in the fashion industry. Manag Sci 44:301–310
Degraeve Z, Gochet W, Jans R (2002) Alternative formulations for a layout problem in the fashion industry. Eur J Oper Res 143:80–93
Ekici A, Ergun Ö, Keskinocak P, Lagoudakis MG (2010) Optimal job splitting on a multi-slot machine with applications in the printing industry. Naval Res Logist 57:237–251
Elaoud S, Teghem J, Bouazizc B (2007) Genetic algorithms to solve the cover printing problem. Comput Oper Res 34:3346–3361
Jans R (2009) Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. Inf J Comput 21:123–136
Jans R, Desrosiers J (2013) Efficient symmetry breaking formulations for the job grouping problem. Comput Oper Res 40:1132–1142
Martens J (2004) Two genetic algorithms to solve a layout problem in the fashion industry. Eur J Oper Res 154:304–322
Mohan SR, Neogy SK, Seth A, Garg NK, Mittal S (2007) An optimization model to determine master designs and runs for advertisement printing. J Math Model Algorithms 6:259–271
Peeters M, Degraeve Z (2004) The co-printing problem: a packing problem with a color constraint. Oper Res 52:623–638
Romero D, Alonso-Pecina F (2012) Ad hoc heuristic for the cover printing problem. Discret Optim 9:17–28
Rose DM, Shier DR (2007) Cut scheduling in the apparel industry. Comput Oper Res 34:3209–3228
Teghem J, Pirlot M, Antoniadis C (1995) Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem. J Comput Appl Math 64:91–102
Tuyttens D, Vandaele A (2010) Using a greedy random adaptative search procedure to solve the cover printing problem. Comput Oper Res 37:640–648
Wark P, Holt J (1994) A repeated matching heuristic for the vehicle routing problem. J Oper Res Soc 45:1156–1167
Yiu KFC, Mak KL, Lau HYK (2007) A heuristic for the label printing problem. Comput Oper Res 34:2576–2588
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baumann, P., Forrer, S. & Trautmann, N. Planning of a make-to-order production process in the printing industry. Flex Serv Manuf J 27, 534–560 (2015). https://doi.org/10.1007/s10696-014-9203-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10696-014-9203-1