Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type

Publication Type:
Journal Article
Information Processing Letters, 2011, 111 (5), pp. 208 - 212
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2012001328OK.pdf221.63 kB
Adobe PDF
This paper addresses the total completion time minimization in a two-stage differentiation flowshop where the sequences of jobs per type are predetermined. The two-stage differentiation flowshop consists of a stage-1 common machine and m stage-2 parallel dedicated machines. The goal is to determine an optimal interleaved processing sequence of all jobs at the first stage. We propose an O(m2∏mk=1nm+1k) dynamic programming algorithm, where nk is the number of type-k jobs. The running time is polynomial when m is constant. © 2010 Elsevier B.V.
Please use this identifier to cite or link to this item: