Exact and Heuristic Methods for Minimizing the Total Completion Time in Job-shops - Université de Lorraine Accéder directement au contenu
Article Dans Une Revue Studies in Informatics and Control Année : 2014

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

Résumé

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.
Fichier principal
Vignette du fichier
SIC_2014-1-Art4.pdf (151.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04000668 , version 1 (22-02-2023)

Identifiants

Citer

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, 2014, 23 (1), ⟨10.24846/v23i1y201404⟩. ⟨hal-04000668⟩
10 Consultations
9 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More