The two-machine flow-shop serial-batching scheduling problem with limited batch size

Bouzaiene, Afef; Aloulou, Mohamed Ali; Dridi, Najoua; Vanderpooten, Daniel

Bouzaiene, Afef; Aloulou, Mohamed Ali; Dridi, Najoua; Vanderpooten, Daniel (2010), The two-machine flow-shop serial-batching scheduling problem with limited batch size, 12th International Conference on Project Management and Scheduling (PMS 2010), Tours, FRANCE

View/Open

cahier290.pdf (219.0Kb)

Type

Communication / Conférence

Date

2010

Conference title

12th International Conference on Project Management and Scheduling (PMS 2010)

Conference city

Tours

Conference country

FRANCE

Metadata

Show full item record

Author(s)

Bouzaiene, Afef
Aloulou, Mohamed Ali
Dridi, Najoua
Vanderpooten, Daniel

Abstract (EN)

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.

Subjects / Keywords

limited batch size; two-machine flow-shop; makespan; batch cost; serial batching