Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case

John Martinovic () and Guntram Scheithauer ()
Additional contact information
John Martinovic: Technische Universität Dresden
Guntram Scheithauer: Technische Universität Dresden

Annals of Operations Research, 2018, vol. 271, issue 2, No 21, 829 pages

Abstract: Abstract We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: find the maximum number of objects, each having a length of at least L, that can be constructed by connecting a given supply of $$ m \in \mathbb {N} $$ m ∈ N smaller item lengths $$ l_1,\ldots ,l_m $$ l 1 , … , l m with availabilities $$ b_1,\ldots , b_m $$ b 1 , … , b m . For this $$\mathcal {NP}$$ NP -hard discrete optimization problem, the (additive integrality) gap, i.e., the difference between the optimal objective values of the continuous relaxation and the skiving stock problem itself, is known to be strictly less than 3 / 2 if $$ l_i \mid L $$ l i ∣ L is assumed for all items, hereinafter referred to as the divisible case. Within this framework, we derive sufficient conditions that ensure the integer round-down property, i.e., a gap smaller than one, of a given instance. As a main contribution, we present improved upper bounds for the gap (of special subclasses) of the divisible case by means of combinatorial and algorithmic approaches. In a final step, possible generalizations of the introduced concepts are discussed. Altogether, the results presented in this paper give strong evidence that 22 / 21 represents the best possible upper bound for the gap of divisible case instances.

Keywords: Cutting and packing; Skiving stock problem; Additive integrality gap; Divisible case; Integer round-down property (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-018-2762-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:annopr:v:271:y:2018:i:2:d:10.1007_s10479-018-2762-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-018-2762-x

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().