Exact and Heuristic Methods for Minimizing the Total Completion Time in Job-shops - Université de Lorraine Access content directly
Journal Articles Studies in Informatics and Control Year : 2014

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.
No file

Dates and versions

hal-01267624 , version 1 (04-02-2016)

Identifiers

  • HAL Id : hal-01267624 , version 1

Cite

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), pp.31-40. ⟨hal-01267624⟩
61 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More