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

Journal	Theoretical Computer Science ISSN: 0304-3975
Output data	Year: 2019, Number: 793, Pages: 70 - 78 Pages count : 9 DOI: 10.1016/j.tcs.2019.05.02
Tags	Scheduling, Bicriteria optimization, Approximation, Computational complexity, Fixed parameter tractability
Authors	Kononov Alexander Veniaminovich 1 , Kovalyov M.Y. 2 , Lin B.M.T. 3
Affiliations	1 Sobolev Institute of Mathematics, Novosibirsk, Russia 2 United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus 3 Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan