# No-wait flow shop problem with two mixed batching machines

1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We study a problem of scheduling $n$ tasks in a no-wait flowshop consisting of two batching machines. Each task has to be processed by both machines. All tasks visit the machines in the same order. Batching machines can process several tasks in batch so that all tasks of the same batch start and complete together. The processing time of a batch on the first batching machine is equal to the maximal processing time of the tasks in this batch, and on the second batching machine is equal to the sum of the processing time of tasks in this batch. We assume that the capacity of any batch on the fist machine is bounded, and when a batch is completed on an upstream machine should immediately transferred to the dowstream machine. The aim is to make batching and sequencing decisions so that the makespan is minimized. We prove that the makespan minimization is NP-Hard in strong sense, and we give some well solvable cases.
Keywords :
Type de document :
Communication dans un congrès
Third Conference on Management and Control of Production and Logistics - MCPL'2004, 2004, Santiago, Chilie, 6 p, 2004
Domaine :

https://hal.inria.fr/inria-00108089
Contributeur : Publications Loria <>
Soumis le : jeudi 19 octobre 2006 - 15:40:57
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

### Identifiants

• HAL Id : inria-00108089, version 1

### Citation

Ammar Oulamara. No-wait flow shop problem with two mixed batching machines. Third Conference on Management and Control of Production and Logistics - MCPL'2004, 2004, Santiago, Chilie, 6 p, 2004. 〈inria-00108089〉

### Métriques

Consultations de la notice