The generalized bin packing problem |
| |
| Institution: | 1. DEI ‘Guglielmo Marconi University of Bologna, Italy;2. DISMI, University of Modena and Reggio Emilia, Italy;1. Warwick Business School, University of Warwick, Coventry, CV4 7AL, UK;2. School of Management, University of Bath, Claverton Down, Bath BA2 7AY, UK;3. Econometric Institute, Erasmus University Rotterdam, 3000 DR Rotterdam, The Netherlands;1. Faculty of Engineering and Sciences, Universidad Adolfo Ibáñez, Av. Padre Hurtado 750, Office C216, Viña del Mar, Chile;2. Escola Universitària d’Enginyeria Tècnica Industrial de Barcelona, Universitat Politècnica de Catalunya, C. Comte Urgell, 187 1st. Floor, 08036 Barcelona, Spain |
| |
| Abstract: | In the Generalized Bin Packing Problem (GBPP), given two sets of compulsory and non-compulsory items characterized by volume and profit and a set of bins with given volume and cost, we want to select the subset of profitable non-compulsory items to be loaded together with the compulsory ones into the appropriate bins in order to minimize the total net cost. Lower and upper bounds to the GBPP are given. The results of extensive computational experiments show that the proposed procedures are efficient and the bounds are tight. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
