Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
64 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
54 | en_US |
dc.citation.volume |
238 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Lee, Kangbok | en_US |
dc.contributor.author |
Leung, Joseph Y-T. | en_US |
dc.contributor.author |
Jia, Zhao-hong | en_US |
dc.contributor.author |
Li, Wenhua | en_US |
dc.contributor.author |
Pinedo, Michael L. | en_US |
dc.contributor.author |
Lin, Bertrand 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:36:16Z | |
dc.date.available |
2014-12-08T15:36:16Z | |
dc.date.issued |
2014-10-01 | en_US |
dc.description.abstract |
We consider parallel machine scheduling problems where the processing of the jobs on the machines involves two types of objectives. The first type is one of two classical objective functions in scheduling theory: either the total completion time or the makespan. The second type involves an actual cost associated with the processing of a specific job on a given machine: each job-machine combination may have a different cost. Two bi-criteria scheduling problems are considered: (1) minimize the maximum machine cost subject to the total completion time being at its minimum, and (2) minimize the total machine cost subject to the makespan being at its minimum. Since both problems are strongly NP-hard, we propose fast heuristics and establish their worst-case performance bounds. (C) 2014 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.ejor.2014.03.026 | en_US |
dc.identifier.issn |
0377-2217 | en_US |
dc.identifier.journal |
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.ejor.2014.03.026 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/24600 | |
dc.identifier.wosnumber |
WOS:000337261600005 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Bi-criteria scheduling | en_US |
dc.subject |
Maximum machine cost | en_US |
dc.subject |
Total machine cost | en_US |
dc.subject |
Makespan | en_US |
dc.subject |
Total completion time | en_US |
dc.subject |
Heuristics | en_US |
dc.title |
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs | en_US |
dc.type |
Article | en_US |
檔案
- 000337261600005.pdf (473.8 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Lee, K., Leung, J. Y.-T., Jia, Z.-H., Li, W., Pinedo, M. L., & Lin, B. M. T. (2014). Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 238(1), 54–64. https://doi.org/10.1016/j.ejor.2014.03.026
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/24600