Efficient scheduling of Internet banner advertisements
ACM Transactions on Internet Technology (TOIT)
Mass customization in cutting stock process
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Production planning in furniture settings via robust optimization
Computers and Operations Research
An augmented beam search-based algorithm for the circular open dimension problem
Computers and Industrial Engineering
Integrated pulp and paper mill planning and scheduling
Computers and Industrial Engineering
Solving the circular open dimension problem by using separate beams and look-ahead strategies
Computers and Operations Research
| Hi-index | 0.00 |
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 adual-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 decomposableinteger 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.