Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03470397
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Wednesday, December 8, 2021 - 11:29:55 AM
Last modification on : Thursday, December 9, 2021 - 3:47:49 AM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Les métriques sont temporairement indisponibles