Planning of a make-to-order production process in the printing industry

被引:0
作者
Philipp Baumann
Salome Forrer
Norbert Trautmann
机构
[1] University of Bern,
来源
Flexible Services and Manufacturing Journal | 2015年 / 27卷
关键词
Real-world production process; Mixed-binary linear program; Symmetry-breaking constraints; Savings heuristic ; Matching problem;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:534 / 560
页数:26
相关论文
共 41 条
[1]  
Altinkemer K(1991)Parallel savings based heuristics for the delivery problem Operations Research 39 456-469
[2]  
Gavish B(1964)Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 568-581
[3]  
Clarke G(1998)A mixed integer programming model for solving a layout problem in the fashion industry Management Science 44 301-310
[4]  
Wright J(2002)Alternative formulations for a layout problem in the fashion industry European Journal of Operational Research 143 80-93
[5]  
Degraeve Z(2010)Optimal job splitting on a multi-slot machine with applications in the printing industry Naval Research Logistics 57 237-251
[6]  
Vandebroek M(2007)Genetic algorithms to solve the cover printing problem Computers & Operations Research 34 3346-3361
[7]  
Degraeve Z(2009)Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints Informs Journal on Computing 21 123-136
[8]  
Gochet W(2013)Efficient symmetry breaking formulations for the job grouping problem Computers & Operations Research 40 1132-1142
[9]  
Jans R(2004)Two genetic algorithms to solve a layout problem in the fashion industry European Journal of Operational Research 154 304-322
[10]  
Ekici A(2007)An optimization model to determine master designs and runs for advertisement printing Journal of Mathematical Modelling and Algorithms 6 259-271