Order Allocation for Stock Cutting in the Paper Industry

Syam Menon () and Linus Schrage ()
Additional contact information
Syam Menon: College of Business Administration, Oklahoma State University, Stillwater, Oklahoma 74078
Linus Schrage: Graduate School of Business, University of Chicago, Chicago, Illinois 60637

Operations Research, 2002, vol. 50, issue 2, 324-332

Abstract: 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.

Keywords: Production/scheduling; cutting stock: multimachine order allocation, Programming, integer, applications: decomposition (search for similar items in EconPapers)
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.50.2.324.427 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:50:y:2002:i:2:p:324-332

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().