A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size

Authors:
M. A. Aloulou;A. Bouzaiene;N. Dridi;D. Vanderpooten
Affiliations:
PSL, Université Paris-Dauphine, Paris Cedex 16, France 75775 and CNRS, LAMSADE UMR 7243, Paris Cedex 16, France;PSL, Université Paris-Dauphine, Paris Cedex 16, France 75775 and CNRS, LAMSADE UMR 7243, Paris Cedex 16, France;OASIS--Ecole Nationale d'Ingénieurs de Tunis, Tunis, Tunisia;PSL, Université Paris-Dauphine, Paris Cedex 16, France 75775 and CNRS, LAMSADE UMR 7243, Paris Cedex 16, France
Venue:
Journal of Scheduling
Year:
2014

Citing 3
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops

INFORMS Journal on Computing
Integrated Production and Outbound Distribution Scheduling: Review and Extensions

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the two-machine flow-shop serial-batching scheduling problem where the machines have a limited capacity in terms of the number of jobs. Two criteria are considered here. The first criterion is the number of batches to be minimized. This criterion reflects situations where processing of any batch induces a fixed cost, which leads to a total cost proportional to the number of batches. The second criterion is the makespan. This model is relevant in different production contexts, especially when considering joint production and inbound delivery scheduling. We study the complexity of the problem and propose two polynomial-time approximation algorithms with a guaranteed performance. The effectiveness of these algorithms is evaluated using numerical experiments. Exact polynomial-time algorithms are also provided for some particular cases.