Scheduling hybrid flowshop with parallel batching machines and compatibilities. - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2008

Scheduling hybrid flowshop with parallel batching machines and compatibilities.

Résumé

This paper considers a two-stage hybrid flowshop problem in which the first stage contains several identical discrete machines, and the second stage contains several identical batching machines. Each discrete machine can process no more than one task at time, and each batching machine can process several tasks simultaneously in a batch with the additional feature that the tasks of the same batch have to be compatible. A compatibility relation is defined between each pair of tasks, so that an undirected compatibility graph is obtained which turns out to be an interval graph. The batch processing time is equal to the maximal processing time of the tasks in this batch, and all tasks of the same batch start and finish together. The goal is to make batching and sequencing decisions in order to minimize the makespan. Since the problem is NP-hard, we develop several heuristics along with their worst cases analysis. We also consider the case in which tasks have the same processing time on the first stage, for which a polynomial time approximation scheme (PTAS) algorithm is presented.
Fichier principal
Vignette du fichier
COR.pdf (267.26 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00582858 , version 1 (04-04-2011)

Identifiants

Citer

Adrien Bellanger, Ammar Oulamara. Scheduling hybrid flowshop with parallel batching machines and compatibilities.. Computers and Operations Research, 2008, 36 (6), pp.1982-1992. ⟨10.1016/j.cor.2008.06.011⟩. ⟨inria-00582858⟩
140 Consultations
235 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More