Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax

A. V. Kononov, M. Y. Kovalyov, Bertrand M.T. Lin*

*此作品的通信作者

研究成果: Article同行評審

摘要

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||Cmax. 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 Δ-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(mn2k) time dynamic programming algorithm is also presented, where k is the fixed number of distinct job processing times.

原文English
頁(從 - 到)70-78
頁數9
期刊Theoretical Computer Science
793
DOIs
出版狀態Published - 12 十一月 2019

指紋

深入研究「Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||C<sub>max</sub>」主題。共同形成了獨特的指紋。

引用此