標題: 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
公開日期: 1-二月-2011
摘要: 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.
URI: http://dx.doi.org/10.1016/j.ipl.2010.11.021
http://hdl.handle.net/11536/25837
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.11.021
期刊: INFORMATION PROCESSING LETTERS
Volume: 111
Issue: 5
起始頁: 208
結束頁: 212
顯示於類別:期刊論文


文件中的檔案:

  1. 000287271000002.pdf