Exact methods for the hybrid flowshop problem with batching machines - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Exact methods for the hybrid flowshop problem with batching machines

Résumé

In this abstract, we consider makespan minimization in the twostage hybrid flowshop. The first stage contains several identical machines and the second stage contains several batching machines. Processing time of each task is given by an interval on batching machines, and tasks of a same batch have to share a common processing time. We present two branch and bound methods to solve this problem. Direct method solves the previous problem, whereas reverse method solves the reversed problem. Several computational experiments will be presented to show the efficiency of our method.
Fichier non déposé

Dates et versions

hal-00595726 , version 1 (25-05-2011)

Identifiants

  • HAL Id : hal-00595726 , version 1

Citer

Adrien Bellanger, Ammar Oulamara. Exact methods for the hybrid flowshop problem with batching machines. 23rd European Conference on Operational Research - EURO Conference 2009, Jul 2009, Bonn, Germany. pp.32. ⟨hal-00595726⟩
32 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More