Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
39 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
29 | en_US |
dc.citation.volume |
9 | en_US |
dc.citation.woscount |
4 | |
dc.contributor.author |
Hwang, F. J. | en_US |
dc.contributor.author |
Kovalyov, M. Y. | en_US |
dc.contributor.author |
Lin, B. M. T. | en_US |
dc.contributor.department |
資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department |
Department of Information Management and Finance | en_US |
dc.date.accessioned |
2014-12-08T15:22:23Z | |
dc.date.available |
2014-12-08T15:22:23Z | |
dc.date.issued |
2012-02-01 | en_US |
dc.description.abstract |
This paper addresses scheduling n jobs in a two-machine flow shop to minimize the total completion time, subject to the condition that the jobs are processed in the same given sequence on both machines. A new concept of optimal schedule block is introduced, and polynomial time dynamic programming algorithms employing this concept are derived for two specific problems. In the first problem, the machine-2 processing time of a job is a step increasing function of its waiting time between the machines, and a decision about machine-1 idle time insertion has to be made. This problem is solved in O(n(2)) time. In the second problem, the jobs are processed in batches and each batch is preceded by a machine-dependent setup time. An O(n(5)) algorithm is developed to find an optimal batching decision. (C) 2011 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.disopt.2011.11.001 | en_US |
dc.identifier.issn |
1572-5286 | en_US |
dc.identifier.journal |
DISCRETE OPTIMIZATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.disopt.2011.11.001 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/15846 | |
dc.identifier.wosnumber |
WOS:000301878700003 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Two-machine flow shop | en_US |
dc.subject |
Total completion time | en_US |
dc.subject |
Fixed sequence | en_US |
dc.subject |
Dynamic programming | en_US |
dc.title |
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence | en_US |
dc.type |
Article | en_US |
檔案
- 000301878700003.pdf (514.6 KB, Adobe PDF)
所屬典藏: 期刊論文