Mehdi Serairi

Learn More
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)
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)
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.
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)
  • 1