Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
0 | en_US |
dc.citation.spage |
0 | en_US |
dc.citation.woscount |
0 | en_US |
dc.contributor.author |
Cheng, T. C. E. | en_US |
dc.contributor.author |
Kravchenko, Svetlana A. | 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 |
2020-10-05T02:01:10Z | |
dc.date.available |
2020-10-05T02:01:10Z | |
dc.date.issued |
1970-01-01 | en_US |
dc.description.abstract |
We study server scheduling on parallel dedicated machines to minimize the makespan subject to given processing sequences. Before a job starts its processing on its designated machine, a loading operation must be performed, which is undertaken by a server shared by all the jobs. While the two-machine problem is polynomially solvable, we show that the problem becomes binaryNP-hard when the number of machines is three, and propose a pseudo-polynomial algorithm to solve the problem with a constant number of machines. | en_US |
dc.identifier.doi |
10.1080/01605682.2020.1779625 | en_US |
dc.identifier.issn |
0160-5682 | en_US |
dc.identifier.journal |
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1080/01605682.2020.1779625 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/155218 | |
dc.identifier.wosnumber |
WOS:000555220900001 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Parallel machines | en_US |
dc.subject |
fixed job sequence | en_US |
dc.subject |
single server | en_US |
dc.subject |
makespan | en_US |
dc.subject |
complexity | en_US |
dc.subject |
dynamic programming | en_US |
dc.title |
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
Cheng, T. C. E., Kravchenko, S. A., & Lin, B. M. T. (1970). Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 0. https://doi.org/10.1080/01605682.2020.1779625
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/155218