文章基本信息

标题：VARIANTS OF THE CUTTING STOCK PROBLEM
本地全文：下载
作者：M. M. Malik ; J. H. Taplin ; M. Qiu 等
期刊名称：International Journal of Economics and Finance Studies
电子版ISSN：1309-8055
出版年度：2013
卷号：5
期号：2
出版社：Social Sciences Research Society
摘要：Over the years, column generation based algorithms such as branch and price have been the preferred solution techniques for the classical cutting stock problem (CSP). However, most cutting stock problems encountered in the real world are variants of the classical CSP with many more complexities. The exact algorithms have been found wanting for these variant problems such as cutting stock with knives setup considerations, pattern minimization, ordered cutting stock, order spread minimization, minimization of open stacks, CSP with contiguity, CSP with due dates and service level considerations, CSP with multiple objectives and integration of the cutting stock problem with other production processes. This paper studies the cutting stock variants with an emphasis on the optimality of solutions obtained by the approximate methods.
关键词：Cutting Stock Problems; Computational Techniques; Optimization