A 0-1 Model for Solving the Corrugator Trim Problem
提出一种0-1整数规划方法，系统解决瓦楞纸箱厂中客户订单组合的裁切问题，兼顾废料最小化、宽度利用、模式切换等权衡，避免订单分散到多种纸幅，适用于计算机中等规模求解。
A new method for solving the corrugator trim problem is presented. This problem draws its name from the difficult task facing scheduling personnel in corrugator box plants each day: to determine the least-cost method of combining customer orders on the corrugator, where one of the major costs to avoid is waste or excess trim lost from the materials used. Trim loss, however, is only one of several major concerns. Others include corrugator width utilization, cutting pattern changes, avoidance of split orders, and so on. A full discussion of these factors and associated trade-offs is included in the paper. The solution procedure presented is capable of dealing with these and other trade-offs in a systematic manner. In particular, this approach eliminates the spreading of orders over several stock sizes, a characteristic which has plagued the linear programming-based procedures that have been proposed for solving the problem. This improved material handling characteristic of the solution is obtained through the controlled generation of solution elements. These elements then become potential activities to be scheduled by a 0-1 integer programming algorithm. The algorithm used is well suited to computers of moderate size and speed. In addition to solving the corrugator trim problem, the proposed method has sufficient flexibility to make it a useful vehicle for solving similar problems in other industries which manufacture such products as glass, steel, composition board, and furniture.