The skiving stock problem as a counterpart of the cutting stock problem

Abstract

AbstractThe cutting stock problem (CSP) is a particular case of the set‐covering problem. Similarly we introduce another class of combinatorial optimization problems called the skiving stock problem (SSP) as a particular case of the set‐packing problem. The SSP shares many properties and solving techniques with the CSP. When these two problem spaces are contrasted they illuminate one another in that they form a ‘dual’ relationship where techniques once thought to be applicable in one domain can be applied in the other. Furthermore the SSP, like the CSP, may have numerous applications in business and industry.