#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2009

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mohamed Haouari, Mehdi Serairi
- Computers & OR
- 2009

The Variable Sized Bin Packing Problem has a wide range of application areas including packing, scheduling, and manufacturing. Given a list of items and variable sized bin types, the objective is to minimize the total size of the used bins. This problem is known to be NP-hard. In this article, we present two new heuristics for solving the problem using a… (More)

- Mohamed Haouari, Mehdi Serairi
- Comp. Opt. and Appl.
- 2011

We address a generalization of the classical one-dimensional bin packing problem with unequal bin sizes and costs. We investigate lower bounds for this problem as well as exact algorithms. The main contribution of this paper is to show that embedding a tight network flow-based lower bound, dominance rules, as well as an effective knapsack-based heuristic in… (More)

- Anis Gharbi, Talel Ladhari, Mohamed Kais Msakni, Mehdi Serairi
- European Journal of Operational Research
- 2013

- Anis Kooli, Mehdi Serairi
- Computers & OR
- 2014

In this paper, we consider the problem of scheduling, on a one-machine, a set of operations subject to unequal release dates with respect to the total completion time. This problem is known to be NPhard in the strong sense. We propose an algorithm based on a Mixed Integer Linear Programming. This algorithm includes the implementation of a preprocessing… (More)

- Anis Gharbi, Talel Ladhari, Mohamed Kais Msakni, Mehdi Serairi
- Electronic Notes in Discrete Mathematics
- 2010

In this paper, we address the problem of two-machine flowshop scheduling problem with sequence independent setup times to minimize the total completion time. We propose five new polynomial lower bounds. Computational results based on randomly generated data show that our proposed lower bounds consistently outperform those of the literature.

- Ammar Oulamara, Djamal Rebaine, Mehdi Serairi
- Annals OR
- 2013

- Mehdi Serairi, Mohamed Haouari
- Electronic Notes in Discrete Mathematics
- 2010

We survey lower bounds for the variant of the two-dimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al.[5] between their lower bounds and those of Boschetti and Mingozzi [1] is not valid. We analyze the performance of lower bounds from the literature and we provide the results of a… (More)

- Aziz Moukrim, Djamal Rebaine, Mehdi Serairi
- RAIRO - Operations Research
- 2014

- ‹
- 1
- ›