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...

Celý popis

Podrobná bibliografia

Vydané v:	2019 IEEE 5th International Conference on Computer and Communications (ICCC) s. 164 - 169
Hlavní autori:	Yin, Ai-Hua, Huang, Jiang-hai, Hu, Dong-ping, Chen, Chong
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.12.2019
Predmet:	Conferences defects Dynamic programming Heuristic algorithms Industries Layout NP-hard optimization Process control Programming two-dimensional cutting problem
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!