Online cutting stock optimization with prioritized orders

ISSN： 0144-5154

Source： Assembly Automation, Vol.25, Iss.1, 2005-03, pp. : 66-72

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 Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 1, Iss. 2, 2010-04 ,pp. : 34-49

IGI Global_journal

Access to resources Recommend Favorite

On-line algorithms for orders

By Bouchitte V. Rampon J.-X.

Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. : 225-238

Elsevier

Access to resources Recommend Favorite

Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem

By Ladanyi Laszlo

Annals of Operations Research, Vol. 139, Iss. 1, 2005-10 ,pp. : 243-265

Springer Publishing Company

Access to resources Recommend Favorite

On-line chain partitions of orders

By Felsner S.

Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. : 283-292

Elsevier

Access to resources Recommend Favorite

Bun splitting: a practical cutting stock problem

By Glass Celia

Annals of Operations Research, Vol. 179, Iss. 1, 2010-09 ,pp. : 15-33

Springer Publishing Company

Access to resources Recommend Favorite