Paper Info
Title
A bicriteria flow-shop scheduling problem with two serial batching machines
Abstract
We consider a bicriteria two-machine flow-shop serial-batch problem where the batches have limited size. 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. We provide a dynamic programming algorithm in the case where the jobs processing times on the first machine are constant. We also establish a dominance relation allowing us to derive an alternative algorithm with better complexity when the batch size is equal to two.
Year
DOI
Venue
2010
10.1016/j.endm.2010.05.149
Electronic Notes in Discrete Mathematics
Keywords
DocType
Volume
makespan,limited batch size,bicriteria scheduling,dominance relation,batch cost,dynamic programming,Two-machine flow-shop,serial batching
Journal
36
ISSN
Citations 
PageRank 
Electronic Notes in Discrete Mathematics
0
0.34
References 
Authors
2
4
Name
Order
Citations
PageRank
Afef Bouzaiene100.34
Najoua Dridi2375.21
Mohamed Ali Aloulou31028.31
Daniel Vanderpooten4115374.66