Makespan minimization in a no-wait flow shop problem with two batching machines - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2007

Makespan minimization in a no-wait flow shop problem with two batching machines

(1)
1

Abstract

This paper deals with the problem of task scheduling in a no-wait flowshop with 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 per batch so that all tasks of the same batch start and complete together. The batch processing time for the first machine is equal to the maximal processing time of the tasks in this batch, and for the second machine is equal to the sum of the processing times of the tasks in this batch. We assume that the capacity of any batch on the first machine is bounded, and that when a batch is completed on the first machine it is immediately transferred to the second machine. The aim is to make batching and sequencing decisions that allow the makespan to be minimized.

Dates and versions

inria-00595610 , version 1 (25-05-2011)

Identifiers

Cite

Ammar Oulamara. Makespan minimization in a no-wait flow shop problem with two batching machines. Computers and Operations Research, 2007, 34 (4), pp.1033--1050. ⟨10.1016/j.cor.2005.05.028⟩. ⟨inria-00595610⟩
42 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More