A tree-search method for solving a cutting stock assignment problem

Author： Smith N. R. Al-Khayyal F. Griffin P.

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.38, Iss.7, 2000-05, pp. : 1557-1578

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A tabu thresholding implementation for the irregular stock cutting problem

By Bennell J. A. Dowsland K. A.

International Journal of Production Research, Vol. 37, Iss. 18, 1999-12 ,pp. : 4259-4275

Taylor & Francis Ltd

Access to resources Recommend Favorite

The one‐dimensional cutting stock problem with sequence‐dependent cut losses

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 23, Iss. 1-2, 2016-01 ,pp. : 5-24

John Wiley & Sons Inc

Access to resources Recommend Favorite

SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration

By Zhu Weihang Curry James Marquez Alberto

International Journal of Production Research, Vol. 48, Iss. 4, 2010-01 ,pp. : 1035-1047

Taylor & Francis Ltd

Access to resources Recommend Favorite

Renovation of the cutting stock process

By Erjavec Jure Gradisar Miro Trkman Peter

International Journal of Production Research, Vol. 47, Iss. 14, 2009-01 ,pp. : 3979-3996

Taylor & Francis Ltd

Access to resources Recommend Favorite

Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry

By Kim Kyungdoc Kim Byung-In Cho Hyunbo

International Journal of Production Research, Vol. 52, Iss. 19, 2014-10 ,pp. : 5675-5689

Taylor & Francis Ltd

Access to resources Recommend Favorite