Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type
| dc.citation.epage | 212 | en_US |
| dc.citation.issue | 5 | en_US |
| dc.citation.spage | 208 | en_US |
| dc.citation.volume | 111 | en_US |
| dc.citation.woscount | 9 | |
| dc.contributor.author | Lin, Bertrand M. T. | en_US |
| dc.contributor.author | Hwang, F. J. | en_US |
| dc.contributor.department | 資訊管理與財務金融系 註：原資管所+財金所 | zh_TW |
| dc.contributor.department | Department of Information Management and Finance | en_US |
| dc.date.accessioned | 2014-12-08T15:37:35Z | |
| dc.date.available | 2014-12-08T15:37:35Z | |
| dc.date.issued | 2011-02-01 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.doi | 10.1016/j.ipl.2010.11.021 | en_US |
| dc.identifier.issn | 0020-0190 | en_US |
| dc.identifier.journal | INFORMATION PROCESSING LETTERS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/j.ipl.2010.11.021 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/25837 | |
| dc.identifier.wosnumber | WOS:000287271000002 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Design of algorithms | en_US |
| dc.subject | Scheduling | en_US |
| dc.subject | Differentiation flowshop | en_US |
| dc.subject | Fixed sequences | en_US |
| dc.subject | Dynamic programming | en_US |
| dc.title | Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type | en_US |
| dc.type | Article | en_US |