刊名:Central European Journal of Operations Research
出版年:2017
出版时间:March 2017
年:2017
卷:25
期:1
页码:139-144
全文大小:
刊物主题:Operation Research/Decision Theory;
出版者:Springer Berlin Heidelberg
ISSN:1613-9178
卷排序:25
文摘
In this short note, we address the coherence between minimizing the sum of squares of machine completion times and minimizing makespan on two identical parallel machines. We show equivalence of the two objectives and identify interesting and useful relations which allow us to transfer worst-case ratios of approximation algorithms from one problem to the other.