A Quick Heuristic-Dynamic Programming for Two-Dimensional Cutting Problem

The two-dimensional rectangular cutting problem with defects is discussed. The goal is to cut a small rectangular block of a given height and width from a large rectangular object containing a plurality of defects on the premise of satisfying several constraints, so that the sum of the area of the c...

Full description

Bibliographic Details

Published in:	2019 IEEE 5th International Conference on Computer and Communications (ICCC) pp. 164 - 169
Main Authors:	Yin, Ai-Hua, Huang, Jiang-hai, Hu, Dong-ping, Chen, Chong
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2019
Subjects:	Conferences defects Dynamic programming Heuristic algorithms Industries Layout NP-hard optimization Process control Programming two-dimensional cutting problem
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!