Ville du colloque

Pays du colloque

URI

Collections

Métadonnées

Auteur

Bouzaiene, Afef

Aloulou, Mohamed Ali

Dridi, Najoua

Vanderpooten, Daniel

Type

Communication / Conférence

Résumé en anglais

We consider the the two-machine flow-shop serial-batching scheduling problem where thebatches have limited size. Two criteria are considered here. The first criterion is to minimizethe number of batches. This criterion reflects situations where processing of any batchinduces a fixed cost, which leads to a total cost proportional to the number of batches. Thesecond criterion is the makespan. We study the complexity of the problem and proposepolynomial-time algorithms for some particular cases and an approximation algorithm witha guaranteed performance for the general case.