Abdellcader El-Kamel

  • Citations Per Year
Learn More
In this paper we consider the single machine scheduling problem with availability constraints in order to minimize the total completion times of jobs. We propose tow exact approaches to solve the problem: a dynamic programming and a branch and bound method. The study of these approaches is carried out in this article and a concluding analysis based on(More)
In this article, we consider the minimization of the total tardiness in a flexible job-shop. In our knowledge, this criterion is not previously studied for this type of shop configuration. The total tardiness criterion was mainly considered in the single machine problem (Chu [Chu92] and Souissi et al. [SKC04]). Few references studied this criterion in a(More)
  • 1