Some Efficient Formulations for the Simultaneous Solution of Trim-Loss and Scheduling Problems in the Paper-Converting Industry

A production optimization problem concerned with the paper-converting industry is considered in the present paper. The problem can be written as a cost minimization or as a profit maximization problem. The problem is to produce a set of product paper reels from larger raw paper reels such that certain specifications are satisfied, while the overall objective function is minimized/maximized. In this formulation, both the widths and lengths of the different raw paper used are utilized as variables. The lengths as well as the ordered amounts of the product paper reels are allowed to vary within certain specified limits. In addition to the trim-loss constraints, constraints for the simultaneous sequential scheduling of the cutting machines is also included, giving time constraints for the cutting machines in the considered formulation. The income from the product paper and overproduction as well as costs derived from the raw paper used, machine time, format changes as well as knife changes are all included in the objective function. A numerical example from the paper-converting industry under consideration is included to illustrate the proposed procedure.

[1]  John F. Pierce Some large-scale production scheduling problems in the paper industry , 1964 .

[2]  Iiro Harjunkoski,et al.  Solving a two-dimensional trim-loss problem with MILP , 1998 .

[3]  Robert W. Haessler,et al.  Controlling Cutting Pattern Changes in One-Dimensional Trim Problems , 1975, Oper. Res..

[4]  Different formulations for solving trim loss problems in a paper-converting mill with ILP , 1996 .

[5]  A. I. Hinxman The trim-loss and assortment problems: A survey , 1980 .

[6]  Constantine Goulimis Optimal solutions for the cutting stock problem , 1990 .

[7]  I. Coverdale,et al.  An Improved Heuristic Procedure for a Nonlinear Cutting Stock Problem , 1976 .

[8]  Iiro Harjunkoski,et al.  Solving a production optimization problem in a paper-converting mill with MILP , 1998 .

[9]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[10]  J. Soeiro Ferreira,et al.  A two-phase roll cutting problem , 1990 .

[11]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[12]  R. W. Haessler A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem , 1971 .

[13]  Gerhard Wäscher An LP-based approach to cutting stock problems with multiple objectives , 1990 .

[14]  Harald Dyckhoff,et al.  Trim loss and related problems , 1985 .

[15]  Robert W. Haessler,et al.  One-dimensional cutting stock decisions for rolls with multiple quality grades , 1990 .