Exact and Heuristic Methods for Minimizing the Total Completion Time in Job-shops

Abstract : In this paper we consider the total completion time minimization in a job-shop. We propose a new mathematical formulation based on a strip packing model. This formulation is enhanced by introducing some valid inequalities in order to compute an efficient lower bound. It is also exploited to derive an exact method; branch-and-bound algorithm which uses an improved solution of a genetic algorithm. The proposed algorithms are tested on standard benchmarks and the results are satisfactory in term of solution quality and the distance to the optimal solution.
Type de document :
Article dans une revue
Studies in Informatics and Control, Informatics and Control Publications, 2014, 23 (1), pp.31-40
Liste complète des métadonnées

https://hal.univ-lorraine.fr/hal-01267624
Contributeur : Catherine Angevelle <>
Soumis le : jeudi 4 février 2016 - 16:10:08
Dernière modification le : mercredi 22 novembre 2017 - 10:56:26

Identifiants

  • HAL Id : hal-01267624, version 1

Collections

Citation

Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih. Exact and Heuristic Methods for Minimizing the Total Completion Time in Job-shops. Studies in Informatics and Control, Informatics and Control Publications, 2014, 23 (1), pp.31-40. 〈hal-01267624〉

Partager

Métriques

Consultations de la notice

57