Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadatas

https://hal.univ-lorraine.fr/hal-01267624
Contributor : Catherine Angevelle <>
Submitted on : Thursday, February 4, 2016 - 4:10:08 PM
Last modification on : Tuesday, October 20, 2020 - 12:08:02 PM

Identifiers

  • 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⟩

Share

Metrics

Record views

134