A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case - Université Polytechnique des Hauts-de-France Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case

Résumé

In our research, we are interested in the three-dimensional multiple-bin-size bin packing problem (MBSBPP). We deal with the real word application of cutting mousse blocks proposed by a Tunisian industrial company. First, we present the general context related to our optimization problem. Second we formulate it as a mathematical problem without considering the guillotine constraint, and then we tested it on small instances taken from the industry. Thereafter, we propose and test a lower bound for large instances from the same industrial company. Finally, some computational results are presented.
Fichier non déposé

Dates et versions

hal-03470397 , version 1 (08-12-2021)

Identifiants

Citer

Mariem Baazaoui, Said Hanafi, Hichem Kamoun. A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case. 2014 International Conference on Control, Decision and Information Technologies (CoDIT), Nov 2014, Metz, France. ⟨10.1109/CoDIT.2014.6996896⟩. ⟨hal-03470397⟩
18 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More