Fuzzy bin packing problem
This paper deals with the fuzzy bin packing problem that is a packing problem of non-rigid rectangles into an open rectangular bin. This problem is different from the conventional bin packing problem, which considers only rigid rectangles. The goal of the fuzzy bin packing problem is to minimize both the height of a packing and the extra cost due to the reduction of each piece. The total cost of the problem is represented as the sum of the height cost and the extra cost due to reductions of the pieces, which is called reduction cost. Because the conventional bin packing problem itself is an NP-hard problem, the presented optimization method assumes that an initial packing for non-reduced pieces has already been found. A closed form solution is presented for fuzzy bin packing problems, in which fuzzy numbers are triangular and the reduction cost is given by a quadratic function. (C) 2001 Elsevier Science B.V. All rights reserved.
bin packing problem quadratic function triangular fuzzy number scheduling