Order allocation for stock cutting in the paper industry
成果类型：
Article
署名作者：
Menon, S; Schrage, L
署名单位：
Oklahoma State University System; Oklahoma State University - Stillwater; University of Chicago
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.50.2.324.427
发表日期：
2002
页码：
324-332
关键词：
摘要：
A common problem encountered in paper-production facilities is that of allocating customer orders to machines so as to minimize the total cost of production. It can be formulated as a dual-angular integer program, with identical machines inducing symmetry. While the potential advantages of decomposing large mathematical programs into smaller subproblems have long been recognized, the solution of decomposable integer programs remains extremely difficult. Symmetry intensifies the difficulty. This paper develops an approach, based on the construction of tight subproblem bounds, to solve decomposable dual-angular integer programs and successfully applies it to solve the problem from the paper industry. This method is of particular interest as it significantly reduces the impact of symmetry.