Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6895830 | European Journal of Operational Research | 2016 | 13 Pages |
Abstract
We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: find the maximum number of items with minimum length L that can be constructed by connecting a given supply of mâN smaller item lengths l1,â¦,lm with availabilities b1,â¦,bm. For this optimization problem, we present three new models (the arcflow model, the onestick model, and a model of Kantorovich-type) and investigate their relationships, especially regarding their respective continuous relaxations. To this end, numerical computations are provided. As a main result, we prove the equivalence between the arcflow model, the onestick approach and the existing pattern-oriented standard model. In particular, this equivalence is shown to hold for the corresponding continuous relaxations, too.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
J. Martinovic, G. Scheithauer,