The optimization algorithm of circle stock problem with standard usage leftover

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In view of the cutting stock problem of the plate fragments and scrap cannot make full use, this paper introduces the concept of standard usage leftover, uses the recursive algorithm and the sequential heuristic procedure to solve the circle cutting problem, achieving the follow-up orders specification to use the usage leftover of the previous orders. This method can make the cutting process more simple, convenient usage leftovers inventory management, as well as conform to the requirements of the blanking for a long time. Computational experimental results show that the algorithm has a high material utilization, and playing a guiding role to the actual industrial production.

Cite

CITATION STYLE

APA

Yan, C., Xie, Q., Chen, Q., Zhang, L., Cui, Y., & Meng, Z. (2017). The optimization algorithm of circle stock problem with standard usage leftover. In IFIP Advances in Information and Communication Technology (Vol. 510, pp. 234–240). Springer New York LLC. https://doi.org/10.1007/978-3-319-68121-4_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free