The proper relaxation and the proper gap of the skiving stock problem

John Martinovic () and Guntram Scheithauer ()
Additional contact information
John Martinovic: Technical University of Dresden
Guntram Scheithauer: Technical University of Dresden

Mathematical Methods of Operations Research, 2016, vol. 84, issue 3, No 4, 527-548

Abstract: Abstract We consider the 1D skiving stock problem (SSP) which is strongly related to the dual bin packing problem: find the maximum number of products with minimum length 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 NP-hard optimization problem, we focus on the proper relaxation and introduce a modeling approach based on graph theory. Additionally, we investigate the quality of the proper gap, i.e., the difference between the optimal objective values of the proper relaxation and the SSP itself. As an introductorily motivation, we prove that the SSP does not possess the integer round down property (IRDP) with respect to the proper relaxation. The main contribution of this paper is given by a construction principle for an infinite number of non-equivalent non-proper-IRDP instances and an enumerative approach that leads to the currently largest known (proper) gap.

Keywords: Cutting and packing; Skiving stock problem; Proper relaxation; Gap (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s00186-016-0552-2 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:mathme:v:84:y:2016:i:3:d:10.1007_s00186-016-0552-2

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

DOI: 10.1007/s00186-016-0552-2

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().