Server scheduling on parallel dedicated machines with fixed job sequences

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2019-06-01

類型

期刊名稱

NAVAL RESEARCH LOGISTICS

卷期與頁次

第 66 卷第 4 期,頁 321–332

ISSN

0894-069X

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

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

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/151971