In this paper an on-line algorithm for the Rectangle Packing Problem is presented. The method is designed to be able to accept or reject incoming boxes to maximize efficiency. We provide a wide computational analysis showing the behavior of the proposed algorithm as well as a comparison with existing off-line heuristics.
An On-line Algorithm for the Rectangle Packing Problem with Rejection
Caramia M;
2003
Abstract
In this paper an on-line algorithm for the Rectangle Packing Problem is presented. The method is designed to be able to accept or reject incoming boxes to maximize efficiency. We provide a wide computational analysis showing the behavior of the proposed algorithm as well as a comparison with existing off-line heuristics.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
