Server scheduling on parallel dedicated machines with fixed job sequences
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
332 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
321 | en_US |
dc.citation.volume |
66 | 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 |
2019-06-03T01:08:36Z | |
dc.date.available |
2019-06-03T01:08:36Z | |
dc.date.issued |
2019-06-01 | en_US |
dc.description.abstract |
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial-time algorithm to solve the two-machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP-hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. | en_US |
dc.identifier.doi |
10.1002/nav.21846 | en_US |
dc.identifier.issn |
0894-069X | en_US |
dc.identifier.journal |
NAVAL RESEARCH LOGISTICS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1002/nav.21846 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/151971 | |
dc.identifier.wosnumber |
WOS:000467423400003 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
fixed job sequence | en_US |
dc.subject |
makespan | en_US |
dc.subject |
parallel dedicated machines | en_US |
dc.subject |
single server | en_US |
dc.title |
Server scheduling on parallel dedicated machines with fixed job sequences | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
Cheng, T. C. E., Kravchenko, S. A., & Lin, B. M. T. (2019). Server scheduling on parallel dedicated machines with fixed job sequences. NAVAL RESEARCH LOGISTICS, 66(4), 321–332. https://doi.org/10.1002/nav.21846
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/151971