|標題:||Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type|
|作者:||Lin, Bertrand M. T.|
Hwang, F. J.
Department of Information Management and Finance
|關鍵字:||Design of algorithms;Scheduling;Differentiation flowshop;Fixed sequences;Dynamic programming|
|摘要:||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(m(2)Pi(m)(k=1)n(k)(m+1)) dynamic programming algorithm, where n(k) is the number of type-k jobs. The running time is polynomial when m is constant. (C) 2010 Elsevier B.V. All rights reserved.|
|期刊:||INFORMATION PROCESSING LETTERS|