Minimizing machine assignment costs over Delta-approximate solutions of the scheduling problem P parallel to C-max

檔案

本條目沒有附加檔案。

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

日期

2019-11-12

類型

期刊名稱

THEORETICAL COMPUTER SCIENCE

卷期與頁次

第 793 卷,頁 70–78

ISSN

0304-3975

語言

英文

摘要

Bi-criteria lexicographical minimization problems with the makespan as the primary objective and the total machine assignment costs as the secondary objective have been recently introduced to the scheduling research, and polynomial time (r + 1, 1)-approximation algorithms have been suggested for their solution, where 1 < r < 2 is the performance ratio of an approximation algorithm for P parallel to C-max. We improve these results by presenting a polynomial time (1.5r - 1, 1)-approximation algorithm for the additive cost type. Then, we introduce a problem of minimizing the total machine assignment cost over the Delta-approximate solutions of the makespan minimization problem. We prove that this new problem is strongly NP-hard and pseudo-polynomially non-approximable in general. A polynomial time approximation algorithm with a guaranteed approximation ratio is presented for the additive cost type and bounded ratio between the maximal and minimal machine costs. An O (mn(2k)) time dynamic programming algorithm is also presented, where k is the fixed number of distinct job processing times. (C) 2019 Elsevier B.V. All rights reserved.

所屬典藏

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

引用此條目

Kononov, A. V., Kovalyov, M. Y., & Lin, B. M. T. (2019). Minimizing machine assignment costs over Delta-approximate solutions of the scheduling problem P parallel to C-max. THEORETICAL COMPUTER SCIENCE, 793, 70–78. https://doi.org/10.1016/j.tcs.2019.05.024

BibTeX RIS

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

分享

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