VARIANTS OF THE CUTTING STOCK PROBLEMAND THE SOLUTION METHODS

• Main Authors: M. M. Malik, J. H. Taplin, M.Qiu
• Format: Article
• Language: English
• Published: Social Sciences Research Society 2013-07-01
• Series: International Journal of Economics and Finance Studies
• Online Access: http://www.sobiad.org/eJOURNALS/journal_IJEF/archieves/2013_2/M.Malik.pdf

Over the years, column generation based algorithms such as branch and pricehave been the preferred solution techniques for the classical cutting stock problem(CSP). However, most cutting stock problems encountered in the real world arevariants of the classical CSP with many more complexities. The exact algorithmshave been found wanting for these variant problems such as cutting stock withknives setup considerations, pattern minimization, ordered cutting stock, orderspread minimization, minimization of open stacks, CSP with contiguity, CSP withdue dates and service level considerations, CSP with multiple objectives andintegration of the cutting stock problem with other production processes. Thispaper studies the cutting stock variantswith an emphasis ontheoptimality ofsolutionsobtained by the approximate methods.