Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
431 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
413 | en_US |
dc.citation.volume |
22 | en_US |
dc.citation.woscount |
0 | en_US |
dc.contributor.author |
Hung, Hui-Chih | en_US |
dc.contributor.author |
Lin, Bertrand M. T. | en_US |
dc.contributor.author |
Posner, Marc E. | en_US |
dc.contributor.author |
Wei, Jun-Min | en_US |
dc.contributor.department |
工業工程與管理學系 | zh_TW |
dc.contributor.department |
資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department |
Department of Industrial Engineering and Management | en_US |
dc.contributor.department |
Department of Information Management and Finance | en_US |
dc.date.accessioned |
2019-08-02T02:15:29Z | |
dc.date.available |
2019-08-02T02:15:29Z | |
dc.date.issued |
2019-08-01 | en_US |
dc.description.abstract |
This paper investigates the classical preemptive parallel-machine scheduling problem of maximizing number of on-time jobs. While the problem is known to be NP-hard, no theoretical analysis of approximation algorithms exists in the literature. As part of the analysis, a new non-standard mixed integer formulation is developed. We propose heuristics based on different design strategies. These heuristics have asymptotically tight relative errors of 1/2. Experimental tests evaluate the computational performance of the procedures. | en_US |
dc.identifier.doi |
10.1007/s10951-018-0584-y | en_US |
dc.identifier.issn |
1094-6136 | en_US |
dc.identifier.journal |
JOURNAL OF SCHEDULING | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s10951-018-0584-y | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/152186 | |
dc.identifier.wosnumber |
WOS:000472217100003 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Parallel-machine scheduling | en_US |
dc.subject |
Number of tardy jobs | en_US |
dc.subject |
Preemption | en_US |
dc.subject |
Mixed integer program | en_US |
dc.subject |
Heuristic performance analysis | en_US |
dc.title |
Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
Hung, H.-C., Lin, B. M. T., Posner, M. E., & Wei, J.-M. (2019). Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. JOURNAL OF SCHEDULING, 22(4), 413–431. https://doi.org/10.1007/s10951-018-0584-y
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/152186